/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 01:34:09,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 01:34:09,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 01:34:09,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 01:34:09,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 01:34:09,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 01:34:09,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 01:34:09,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 01:34:09,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 01:34:09,709 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 01:34:09,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 01:34:09,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 01:34:09,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 01:34:09,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 01:34:09,711 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 01:34:09,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 01:34:09,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 01:34:09,712 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 01:34:09,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 01:34:09,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 01:34:09,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 01:34:09,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 01:34:09,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 01:34:09,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 01:34:09,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 01:34:09,719 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 01:34:09,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 01:34:09,719 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 01:34:09,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 01:34:09,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 01:34:09,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 01:34:09,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 01:34:09,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:34:09,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 01:34:09,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 01:34:09,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 01:34:09,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 01:34:09,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 01:34:09,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 01:34:09,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 01:34:09,722 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 01:34:09,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 01:34:09,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 01:34:09,724 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 01:34:09,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 01:34:10,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 01:34:10,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 01:34:10,009 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 01:34:10,010 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 01:34:10,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2023-12-19 01:34:11,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 01:34:11,433 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 01:34:11,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2023-12-19 01:34:11,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db37f739d/9b5ad519cb944ec2a349a7ed5c80b264/FLAG365cc7cab [2023-12-19 01:34:11,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db37f739d/9b5ad519cb944ec2a349a7ed5c80b264 [2023-12-19 01:34:11,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 01:34:11,461 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 01:34:11,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 01:34:11,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 01:34:11,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 01:34:11,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:11,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2163b741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11, skipping insertion in model container [2023-12-19 01:34:11,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:11,526 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 01:34:11,697 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2023-12-19 01:34:11,755 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2023-12-19 01:34:11,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:34:11,813 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 01:34:11,826 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2023-12-19 01:34:11,842 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2023-12-19 01:34:11,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:34:11,890 INFO L206 MainTranslator]: Completed translation [2023-12-19 01:34:11,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11 WrapperNode [2023-12-19 01:34:11,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 01:34:11,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 01:34:11,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 01:34:11,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 01:34:11,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:11,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:11,939 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 474 [2023-12-19 01:34:11,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 01:34:11,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 01:34:11,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 01:34:11,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 01:34:11,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:11,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:11,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:11,988 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 01:34:11,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:11,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:11,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:12,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:12,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:12,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:12,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 01:34:12,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 01:34:12,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 01:34:12,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 01:34:12,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (1/1) ... [2023-12-19 01:34:12,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:34:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:12,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 01:34:12,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 01:34:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 01:34:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-19 01:34:12,102 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-19 01:34:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-19 01:34:12,104 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-19 01:34:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-19 01:34:12,105 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-19 01:34:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-19 01:34:12,105 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-19 01:34:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-19 01:34:12,105 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-19 01:34:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-19 01:34:12,105 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-19 01:34:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-19 01:34:12,105 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-19 01:34:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-19 01:34:12,106 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-19 01:34:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-19 01:34:12,106 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-19 01:34:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-19 01:34:12,106 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-19 01:34:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-19 01:34:12,106 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-19 01:34:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 01:34:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-19 01:34:12,108 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-19 01:34:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-19 01:34:12,108 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-19 01:34:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 01:34:12,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 01:34:12,109 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-19 01:34:12,109 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-19 01:34:12,109 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2023-12-19 01:34:12,109 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2023-12-19 01:34:12,229 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 01:34:12,232 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 01:34:12,773 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 01:34:12,812 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 01:34:12,813 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-19 01:34:12,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:34:12 BoogieIcfgContainer [2023-12-19 01:34:12,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 01:34:12,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 01:34:12,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 01:34:12,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 01:34:12,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:34:11" (1/3) ... [2023-12-19 01:34:12,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66805e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:34:12, skipping insertion in model container [2023-12-19 01:34:12,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:34:11" (2/3) ... [2023-12-19 01:34:12,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66805e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:34:12, skipping insertion in model container [2023-12-19 01:34:12,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:34:12" (3/3) ... [2023-12-19 01:34:12,820 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2023-12-19 01:34:12,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 01:34:12,836 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-19 01:34:12,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 01:34:12,886 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40dbd83b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 01:34:12,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-19 01:34:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 167 states have (on average 1.6467065868263473) internal successors, (275), 175 states have internal predecessors, (275), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 01:34:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:34:12,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:12,903 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:12,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:12,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2083918704, now seen corresponding path program 1 times [2023-12-19 01:34:12,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172348631] [2023-12-19 01:34:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:12,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:13,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172348631] [2023-12-19 01:34:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172348631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:13,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:34:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012070626] [2023-12-19 01:34:13,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:13,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:13,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:13,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:13,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:13,359 INFO L87 Difference]: Start difference. First operand has 217 states, 167 states have (on average 1.6467065868263473) internal successors, (275), 175 states have internal predecessors, (275), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:34:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:14,015 INFO L93 Difference]: Finished difference Result 437 states and 682 transitions. [2023-12-19 01:34:14,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 01:34:14,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-12-19 01:34:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:14,036 INFO L225 Difference]: With dead ends: 437 [2023-12-19 01:34:14,036 INFO L226 Difference]: Without dead ends: 228 [2023-12-19 01:34:14,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:14,047 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 328 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:14,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 640 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:34:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-12-19 01:34:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2023-12-19 01:34:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 164 states have (on average 1.5182926829268293) internal successors, (249), 169 states have internal predecessors, (249), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-19 01:34:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 309 transitions. [2023-12-19 01:34:14,108 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 309 transitions. Word has length 58 [2023-12-19 01:34:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:14,108 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 309 transitions. [2023-12-19 01:34:14,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:34:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 309 transitions. [2023-12-19 01:34:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:34:14,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:14,112 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:14,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 01:34:14,112 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:14,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash -182462482, now seen corresponding path program 1 times [2023-12-19 01:34:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:14,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652388896] [2023-12-19 01:34:14,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:14,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652388896] [2023-12-19 01:34:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652388896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:14,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:14,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:34:14,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235215832] [2023-12-19 01:34:14,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:14,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:34:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:14,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:34:14,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:34:14,418 INFO L87 Difference]: Start difference. First operand 211 states and 309 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:34:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:15,201 INFO L93 Difference]: Finished difference Result 417 states and 606 transitions. [2023-12-19 01:34:15,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:34:15,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-12-19 01:34:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:15,215 INFO L225 Difference]: With dead ends: 417 [2023-12-19 01:34:15,215 INFO L226 Difference]: Without dead ends: 336 [2023-12-19 01:34:15,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:34:15,219 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 433 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:15,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 938 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:34:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-12-19 01:34:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 299. [2023-12-19 01:34:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 232 states have (on average 1.4870689655172413) internal successors, (345), 239 states have internal predecessors, (345), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2023-12-19 01:34:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 432 transitions. [2023-12-19 01:34:15,283 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 432 transitions. Word has length 58 [2023-12-19 01:34:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:15,283 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 432 transitions. [2023-12-19 01:34:15,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:34:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 432 transitions. [2023-12-19 01:34:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:34:15,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:15,290 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:15,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 01:34:15,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:15,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash -316696146, now seen corresponding path program 1 times [2023-12-19 01:34:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:15,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658335382] [2023-12-19 01:34:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:15,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658335382] [2023-12-19 01:34:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658335382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:34:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026056041] [2023-12-19 01:34:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:15,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:34:15,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:34:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:34:15,486 INFO L87 Difference]: Start difference. First operand 299 states and 432 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:34:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:16,220 INFO L93 Difference]: Finished difference Result 495 states and 708 transitions. [2023-12-19 01:34:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:34:16,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-19 01:34:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:16,225 INFO L225 Difference]: With dead ends: 495 [2023-12-19 01:34:16,225 INFO L226 Difference]: Without dead ends: 333 [2023-12-19 01:34:16,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:34:16,230 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 240 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:16,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1146 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:34:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-19 01:34:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 303. [2023-12-19 01:34:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.476595744680851) internal successors, (347), 242 states have internal predecessors, (347), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2023-12-19 01:34:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 435 transitions. [2023-12-19 01:34:16,270 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 435 transitions. Word has length 58 [2023-12-19 01:34:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:16,270 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 435 transitions. [2023-12-19 01:34:16,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:34:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 435 transitions. [2023-12-19 01:34:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-19 01:34:16,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:16,272 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:16,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 01:34:16,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:16,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:16,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1734287852, now seen corresponding path program 1 times [2023-12-19 01:34:16,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:16,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144742284] [2023-12-19 01:34:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:16,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:16,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144742284] [2023-12-19 01:34:16,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144742284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:16,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:16,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 01:34:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617067816] [2023-12-19 01:34:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:16,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:34:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:16,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:34:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:34:16,415 INFO L87 Difference]: Start difference. First operand 303 states and 435 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:34:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:17,900 INFO L93 Difference]: Finished difference Result 1136 states and 1586 transitions. [2023-12-19 01:34:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 01:34:17,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2023-12-19 01:34:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:17,905 INFO L225 Difference]: With dead ends: 1136 [2023-12-19 01:34:17,906 INFO L226 Difference]: Without dead ends: 958 [2023-12-19 01:34:17,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-12-19 01:34:17,908 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 2012 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2028 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:17,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2028 Valid, 1154 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 01:34:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2023-12-19 01:34:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 841. [2023-12-19 01:34:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 654 states have (on average 1.4051987767584098) internal successors, (919), 669 states have internal predecessors, (919), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2023-12-19 01:34:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1133 transitions. [2023-12-19 01:34:17,955 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1133 transitions. Word has length 58 [2023-12-19 01:34:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:17,956 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1133 transitions. [2023-12-19 01:34:17,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:34:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1133 transitions. [2023-12-19 01:34:17,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:34:17,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:17,957 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:17,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 01:34:17,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:17,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1696915276, now seen corresponding path program 1 times [2023-12-19 01:34:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:17,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067027270] [2023-12-19 01:34:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:18,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:18,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067027270] [2023-12-19 01:34:18,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067027270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:18,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:18,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:34:18,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339021317] [2023-12-19 01:34:18,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:18,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:34:18,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:34:18,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:34:18,128 INFO L87 Difference]: Start difference. First operand 841 states and 1133 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:34:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:18,799 INFO L93 Difference]: Finished difference Result 1655 states and 2209 transitions. [2023-12-19 01:34:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:34:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-12-19 01:34:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:18,805 INFO L225 Difference]: With dead ends: 1655 [2023-12-19 01:34:18,805 INFO L226 Difference]: Without dead ends: 945 [2023-12-19 01:34:18,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:34:18,807 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 241 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:18,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1144 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:34:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2023-12-19 01:34:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 857. [2023-12-19 01:34:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 666 states have (on average 1.3903903903903905) internal successors, (926), 681 states have internal predecessors, (926), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2023-12-19 01:34:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1144 transitions. [2023-12-19 01:34:18,855 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1144 transitions. Word has length 59 [2023-12-19 01:34:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:18,856 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1144 transitions. [2023-12-19 01:34:18,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:34:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1144 transitions. [2023-12-19 01:34:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:34:18,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:18,857 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:18,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 01:34:18,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:18,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash 226312758, now seen corresponding path program 1 times [2023-12-19 01:34:18,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:18,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893198831] [2023-12-19 01:34:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:19,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:19,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:19,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893198831] [2023-12-19 01:34:19,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893198831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:19,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:19,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:34:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026606471] [2023-12-19 01:34:19,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:19,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:34:19,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:34:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:34:19,016 INFO L87 Difference]: Start difference. First operand 857 states and 1144 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:34:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:19,850 INFO L93 Difference]: Finished difference Result 2297 states and 2963 transitions. [2023-12-19 01:34:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 01:34:19,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-12-19 01:34:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:19,859 INFO L225 Difference]: With dead ends: 2297 [2023-12-19 01:34:19,860 INFO L226 Difference]: Without dead ends: 1572 [2023-12-19 01:34:19,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-19 01:34:19,862 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 611 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:19,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 844 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:34:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-12-19 01:34:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1270. [2023-12-19 01:34:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 984 states have (on average 1.3617886178861789) internal successors, (1340), 1008 states have internal predecessors, (1340), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2023-12-19 01:34:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1676 transitions. [2023-12-19 01:34:19,990 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1676 transitions. Word has length 59 [2023-12-19 01:34:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:19,991 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1676 transitions. [2023-12-19 01:34:19,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:34:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1676 transitions. [2023-12-19 01:34:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-19 01:34:19,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:19,992 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:19,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 01:34:19,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:19,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash 445167476, now seen corresponding path program 1 times [2023-12-19 01:34:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724723714] [2023-12-19 01:34:19,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:19,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724723714] [2023-12-19 01:34:20,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724723714] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:20,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:34:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662044211] [2023-12-19 01:34:20,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:20,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:34:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:20,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:34:20,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:20,084 INFO L87 Difference]: Start difference. First operand 1270 states and 1676 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:34:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:20,665 INFO L93 Difference]: Finished difference Result 3541 states and 4615 transitions. [2023-12-19 01:34:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:34:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-12-19 01:34:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:20,676 INFO L225 Difference]: With dead ends: 3541 [2023-12-19 01:34:20,676 INFO L226 Difference]: Without dead ends: 2405 [2023-12-19 01:34:20,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-12-19 01:34:20,680 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 733 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:20,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 563 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:34:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2023-12-19 01:34:20,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2301. [2023-12-19 01:34:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 1755 states have (on average 1.3071225071225072) internal successors, (2294), 1800 states have internal predecessors, (2294), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2023-12-19 01:34:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 2962 transitions. [2023-12-19 01:34:20,885 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 2962 transitions. Word has length 59 [2023-12-19 01:34:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:20,886 INFO L495 AbstractCegarLoop]: Abstraction has 2301 states and 2962 transitions. [2023-12-19 01:34:20,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:34:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2962 transitions. [2023-12-19 01:34:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-19 01:34:20,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:20,887 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:20,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 01:34:20,888 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:20,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1598525080, now seen corresponding path program 1 times [2023-12-19 01:34:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:20,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948349924] [2023-12-19 01:34:20,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:20,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:20,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948349924] [2023-12-19 01:34:20,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948349924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:20,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:20,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:34:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251051666] [2023-12-19 01:34:20,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:20,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:20,966 INFO L87 Difference]: Start difference. First operand 2301 states and 2962 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:34:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:21,625 INFO L93 Difference]: Finished difference Result 5359 states and 6872 transitions. [2023-12-19 01:34:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:34:21,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2023-12-19 01:34:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:21,643 INFO L225 Difference]: With dead ends: 5359 [2023-12-19 01:34:21,644 INFO L226 Difference]: Without dead ends: 3192 [2023-12-19 01:34:21,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:21,653 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 405 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:21,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 671 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:34:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2023-12-19 01:34:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 2948. [2023-12-19 01:34:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2245 states have (on average 1.2966592427616928) internal successors, (2911), 2296 states have internal predecessors, (2911), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2023-12-19 01:34:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3751 transitions. [2023-12-19 01:34:21,894 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3751 transitions. Word has length 60 [2023-12-19 01:34:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:21,895 INFO L495 AbstractCegarLoop]: Abstraction has 2948 states and 3751 transitions. [2023-12-19 01:34:21,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:34:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3751 transitions. [2023-12-19 01:34:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:34:21,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:21,896 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:21,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 01:34:21,897 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:21,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash -713989047, now seen corresponding path program 1 times [2023-12-19 01:34:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:21,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670065014] [2023-12-19 01:34:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:21,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:21,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:21,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:21,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:21,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:21,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670065014] [2023-12-19 01:34:21,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670065014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:21,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:21,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:34:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545261049] [2023-12-19 01:34:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:21,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:34:21,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:21,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:34:21,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:34:21,985 INFO L87 Difference]: Start difference. First operand 2948 states and 3751 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:22,678 INFO L93 Difference]: Finished difference Result 3097 states and 3984 transitions. [2023-12-19 01:34:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:34:22,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-19 01:34:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:22,692 INFO L225 Difference]: With dead ends: 3097 [2023-12-19 01:34:22,692 INFO L226 Difference]: Without dead ends: 2978 [2023-12-19 01:34:22,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:34:22,695 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 379 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:22,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 455 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:34:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2023-12-19 01:34:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2948. [2023-12-19 01:34:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2245 states have (on average 1.2962138084632517) internal successors, (2910), 2296 states have internal predecessors, (2910), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2023-12-19 01:34:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3750 transitions. [2023-12-19 01:34:22,958 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3750 transitions. Word has length 62 [2023-12-19 01:34:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:22,958 INFO L495 AbstractCegarLoop]: Abstraction has 2948 states and 3750 transitions. [2023-12-19 01:34:22,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3750 transitions. [2023-12-19 01:34:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:34:22,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:22,960 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:22,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 01:34:22,960 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:22,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash -754663797, now seen corresponding path program 1 times [2023-12-19 01:34:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978576106] [2023-12-19 01:34:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:22,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:23,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:23,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978576106] [2023-12-19 01:34:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978576106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:34:23,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406361104] [2023-12-19 01:34:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:23,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:23,043 INFO L87 Difference]: Start difference. First operand 2948 states and 3750 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:23,966 INFO L93 Difference]: Finished difference Result 3237 states and 4200 transitions. [2023-12-19 01:34:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:34:23,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-19 01:34:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:23,981 INFO L225 Difference]: With dead ends: 3237 [2023-12-19 01:34:23,981 INFO L226 Difference]: Without dead ends: 3122 [2023-12-19 01:34:23,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:23,984 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 605 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:23,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 592 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:34:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2023-12-19 01:34:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3061. [2023-12-19 01:34:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 2340 states have (on average 1.3068376068376069) internal successors, (3058), 2392 states have internal predecessors, (3058), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2023-12-19 01:34:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 3923 transitions. [2023-12-19 01:34:24,266 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 3923 transitions. Word has length 62 [2023-12-19 01:34:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:24,267 INFO L495 AbstractCegarLoop]: Abstraction has 3061 states and 3923 transitions. [2023-12-19 01:34:24,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 3923 transitions. [2023-12-19 01:34:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:34:24,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:24,268 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:24,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 01:34:24,268 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:24,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:24,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1511717389, now seen corresponding path program 1 times [2023-12-19 01:34:24,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:24,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082073998] [2023-12-19 01:34:24,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:24,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:24,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082073998] [2023-12-19 01:34:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082073998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:34:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652200472] [2023-12-19 01:34:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:24,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:34:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:34:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:24,380 INFO L87 Difference]: Start difference. First operand 3061 states and 3923 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:25,615 INFO L93 Difference]: Finished difference Result 3492 states and 4586 transitions. [2023-12-19 01:34:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:34:25,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-19 01:34:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:25,633 INFO L225 Difference]: With dead ends: 3492 [2023-12-19 01:34:25,633 INFO L226 Difference]: Without dead ends: 3264 [2023-12-19 01:34:25,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:34:25,635 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 608 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:25,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 988 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 01:34:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2023-12-19 01:34:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3167. [2023-12-19 01:34:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 2428 states have (on average 1.314662273476112) internal successors, (3192), 2481 states have internal predecessors, (3192), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2023-12-19 01:34:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4081 transitions. [2023-12-19 01:34:25,956 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4081 transitions. Word has length 62 [2023-12-19 01:34:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:25,957 INFO L495 AbstractCegarLoop]: Abstraction has 3167 states and 4081 transitions. [2023-12-19 01:34:25,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4081 transitions. [2023-12-19 01:34:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:34:25,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:25,959 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:25,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 01:34:25,959 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:25,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:25,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1030637131, now seen corresponding path program 1 times [2023-12-19 01:34:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:25,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677877664] [2023-12-19 01:34:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:26,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:26,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:26,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677877664] [2023-12-19 01:34:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677877664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:26,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:26,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:34:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508914136] [2023-12-19 01:34:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:26,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:34:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:26,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:34:26,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:26,072 INFO L87 Difference]: Start difference. First operand 3167 states and 4081 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:27,333 INFO L93 Difference]: Finished difference Result 3928 states and 5248 transitions. [2023-12-19 01:34:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:34:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-19 01:34:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:27,349 INFO L225 Difference]: With dead ends: 3928 [2023-12-19 01:34:27,349 INFO L226 Difference]: Without dead ends: 3594 [2023-12-19 01:34:27,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:34:27,352 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 622 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:27,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 979 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-19 01:34:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2023-12-19 01:34:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3379. [2023-12-19 01:34:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3379 states, 2606 states have (on average 1.329623944742901) internal successors, (3465), 2661 states have internal predecessors, (3465), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2023-12-19 01:34:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 4402 transitions. [2023-12-19 01:34:27,659 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 4402 transitions. Word has length 62 [2023-12-19 01:34:27,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:27,659 INFO L495 AbstractCegarLoop]: Abstraction has 3379 states and 4402 transitions. [2023-12-19 01:34:27,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 4402 transitions. [2023-12-19 01:34:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:34:27,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:27,661 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:27,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 01:34:27,662 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:27,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1325168119, now seen corresponding path program 1 times [2023-12-19 01:34:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:27,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145465369] [2023-12-19 01:34:27,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:27,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:27,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:27,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:27,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:27,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:27,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145465369] [2023-12-19 01:34:27,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145465369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:27,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:27,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:34:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835940159] [2023-12-19 01:34:27,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:27,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:34:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:34:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:27,755 INFO L87 Difference]: Start difference. First operand 3379 states and 4402 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:29,025 INFO L93 Difference]: Finished difference Result 4662 states and 6359 transitions. [2023-12-19 01:34:29,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 01:34:29,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-19 01:34:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:29,066 INFO L225 Difference]: With dead ends: 4662 [2023-12-19 01:34:29,067 INFO L226 Difference]: Without dead ends: 4116 [2023-12-19 01:34:29,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:34:29,072 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 649 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:29,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 975 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 01:34:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2023-12-19 01:34:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 3760. [2023-12-19 01:34:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 2921 states have (on average 1.3478260869565217) internal successors, (3937), 2980 states have internal predecessors, (3937), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2023-12-19 01:34:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 4972 transitions. [2023-12-19 01:34:29,435 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 4972 transitions. Word has length 62 [2023-12-19 01:34:29,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:29,435 INFO L495 AbstractCegarLoop]: Abstraction has 3760 states and 4972 transitions. [2023-12-19 01:34:29,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4972 transitions. [2023-12-19 01:34:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:34:29,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:29,438 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:29,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 01:34:29,439 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:29,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:29,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1678256501, now seen corresponding path program 1 times [2023-12-19 01:34:29,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:29,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232994666] [2023-12-19 01:34:29,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:29,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:29,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:29,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:29,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232994666] [2023-12-19 01:34:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232994666] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:29,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:34:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405480280] [2023-12-19 01:34:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:29,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:34:29,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:34:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:29,557 INFO L87 Difference]: Start difference. First operand 3760 states and 4972 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:30,245 INFO L93 Difference]: Finished difference Result 4900 states and 6722 transitions. [2023-12-19 01:34:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:34:30,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-19 01:34:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:30,265 INFO L225 Difference]: With dead ends: 4900 [2023-12-19 01:34:30,265 INFO L226 Difference]: Without dead ends: 3973 [2023-12-19 01:34:30,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:30,269 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 604 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:30,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 494 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:34:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2023-12-19 01:34:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3760. [2023-12-19 01:34:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 2921 states have (on average 1.344744950359466) internal successors, (3928), 2980 states have internal predecessors, (3928), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2023-12-19 01:34:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 4963 transitions. [2023-12-19 01:34:30,616 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 4963 transitions. Word has length 62 [2023-12-19 01:34:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:30,616 INFO L495 AbstractCegarLoop]: Abstraction has 3760 states and 4963 transitions. [2023-12-19 01:34:30,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4963 transitions. [2023-12-19 01:34:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 01:34:30,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:30,618 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:30,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 01:34:30,618 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:30,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash 250016201, now seen corresponding path program 1 times [2023-12-19 01:34:30,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:30,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103121900] [2023-12-19 01:34:30,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:30,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:30,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:30,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:30,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103121900] [2023-12-19 01:34:30,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103121900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:30,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:30,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:34:30,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052523188] [2023-12-19 01:34:30,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:30,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:34:30,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:30,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:34:30,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:30,737 INFO L87 Difference]: Start difference. First operand 3760 states and 4963 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:32,224 INFO L93 Difference]: Finished difference Result 7106 states and 10121 transitions. [2023-12-19 01:34:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 01:34:32,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-19 01:34:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:32,261 INFO L225 Difference]: With dead ends: 7106 [2023-12-19 01:34:32,261 INFO L226 Difference]: Without dead ends: 6180 [2023-12-19 01:34:32,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-19 01:34:32,270 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 1300 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:32,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 779 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-19 01:34:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6180 states. [2023-12-19 01:34:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6180 to 5534. [2023-12-19 01:34:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5534 states, 4383 states have (on average 1.3853524982888432) internal successors, (6072), 4473 states have internal predecessors, (6072), 610 states have call successors, (610), 446 states have call predecessors, (610), 539 states have return successors, (908), 624 states have call predecessors, (908), 606 states have call successors, (908) [2023-12-19 01:34:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 7590 transitions. [2023-12-19 01:34:32,788 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 7590 transitions. Word has length 62 [2023-12-19 01:34:32,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:32,788 INFO L495 AbstractCegarLoop]: Abstraction has 5534 states and 7590 transitions. [2023-12-19 01:34:32,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-19 01:34:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 7590 transitions. [2023-12-19 01:34:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-19 01:34:32,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:32,790 INFO L195 NwaCegarLoop]: 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] [2023-12-19 01:34:32,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 01:34:32,791 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:32,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:32,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1532828887, now seen corresponding path program 1 times [2023-12-19 01:34:32,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:32,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793652561] [2023-12-19 01:34:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:32,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:32,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:32,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:32,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:32,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793652561] [2023-12-19 01:34:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793652561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:32,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:34:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492125382] [2023-12-19 01:34:32,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:32,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:32,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:32,856 INFO L87 Difference]: Start difference. First operand 5534 states and 7590 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:34:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:33,546 INFO L93 Difference]: Finished difference Result 8837 states and 11737 transitions. [2023-12-19 01:34:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 01:34:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2023-12-19 01:34:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:33,572 INFO L225 Difference]: With dead ends: 8837 [2023-12-19 01:34:33,572 INFO L226 Difference]: Without dead ends: 6021 [2023-12-19 01:34:33,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:33,582 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 682 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:33,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 483 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:34:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2023-12-19 01:34:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 5792. [2023-12-19 01:34:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5792 states, 4583 states have (on average 1.3779183940650228) internal successors, (6315), 4676 states have internal predecessors, (6315), 638 states have call successors, (638), 471 states have call predecessors, (638), 569 states have return successors, (942), 654 states have call predecessors, (942), 634 states have call successors, (942) [2023-12-19 01:34:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5792 states to 5792 states and 7895 transitions. [2023-12-19 01:34:34,089 INFO L78 Accepts]: Start accepts. Automaton has 5792 states and 7895 transitions. Word has length 66 [2023-12-19 01:34:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:34,090 INFO L495 AbstractCegarLoop]: Abstraction has 5792 states and 7895 transitions. [2023-12-19 01:34:34,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:34:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 5792 states and 7895 transitions. [2023-12-19 01:34:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-19 01:34:34,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:34,092 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:34,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 01:34:34,092 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:34,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -243171438, now seen corresponding path program 1 times [2023-12-19 01:34:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:34,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574025785] [2023-12-19 01:34:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:34,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574025785] [2023-12-19 01:34:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574025785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:34,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:34,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:34:34,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954619299] [2023-12-19 01:34:34,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:34,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:34:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:34,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:34:34,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:34,169 INFO L87 Difference]: Start difference. First operand 5792 states and 7895 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 01:34:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:35,154 INFO L93 Difference]: Finished difference Result 6768 states and 9084 transitions. [2023-12-19 01:34:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:34:35,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2023-12-19 01:34:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:35,180 INFO L225 Difference]: With dead ends: 6768 [2023-12-19 01:34:35,180 INFO L226 Difference]: Without dead ends: 6765 [2023-12-19 01:34:35,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-12-19 01:34:35,185 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 841 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:35,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 588 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:34:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2023-12-19 01:34:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 6481. [2023-12-19 01:34:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6481 states, 5093 states have (on average 1.363832711564893) internal successors, (6946), 5193 states have internal predecessors, (6946), 721 states have call successors, (721), 543 states have call predecessors, (721), 665 states have return successors, (1070), 754 states have call predecessors, (1070), 718 states have call successors, (1070) [2023-12-19 01:34:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 8737 transitions. [2023-12-19 01:34:35,748 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 8737 transitions. Word has length 67 [2023-12-19 01:34:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:35,748 INFO L495 AbstractCegarLoop]: Abstraction has 6481 states and 8737 transitions. [2023-12-19 01:34:35,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 01:34:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 8737 transitions. [2023-12-19 01:34:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-19 01:34:35,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:35,751 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:35,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 01:34:35,751 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:35,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:35,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1050889345, now seen corresponding path program 1 times [2023-12-19 01:34:35,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:35,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909081752] [2023-12-19 01:34:35,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:35,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:35,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:35,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:35,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:35,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909081752] [2023-12-19 01:34:35,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909081752] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434670453] [2023-12-19 01:34:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:35,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:35,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:35,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:35,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 01:34:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:35,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 01:34:35,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:36,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 01:34:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434670453] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 01:34:36,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 01:34:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-12-19 01:34:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890866761] [2023-12-19 01:34:36,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 01:34:36,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:34:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:36,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:34:36,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:34:36,321 INFO L87 Difference]: Start difference. First operand 6481 states and 8737 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 01:34:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:38,568 INFO L93 Difference]: Finished difference Result 10546 states and 13757 transitions. [2023-12-19 01:34:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 01:34:38,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2023-12-19 01:34:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:38,605 INFO L225 Difference]: With dead ends: 10546 [2023-12-19 01:34:38,606 INFO L226 Difference]: Without dead ends: 10543 [2023-12-19 01:34:38,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-12-19 01:34:38,610 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 1016 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:38,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1181 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-19 01:34:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10543 states. [2023-12-19 01:34:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10543 to 9732. [2023-12-19 01:34:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9732 states, 7570 states have (on average 1.3303830911492736) internal successors, (10071), 7721 states have internal predecessors, (10071), 1091 states have call successors, (1091), 868 states have call predecessors, (1091), 1069 states have return successors, (1616), 1152 states have call predecessors, (1616), 1088 states have call successors, (1616) [2023-12-19 01:34:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 12778 transitions. [2023-12-19 01:34:39,513 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 12778 transitions. Word has length 68 [2023-12-19 01:34:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:39,514 INFO L495 AbstractCegarLoop]: Abstraction has 9732 states and 12778 transitions. [2023-12-19 01:34:39,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-19 01:34:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 12778 transitions. [2023-12-19 01:34:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-19 01:34:39,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:39,517 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:39,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:39,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-19 01:34:39,725 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:39,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 104005074, now seen corresponding path program 2 times [2023-12-19 01:34:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878741844] [2023-12-19 01:34:39,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:34:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:39,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878741844] [2023-12-19 01:34:39,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878741844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:39,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:34:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743000545] [2023-12-19 01:34:39,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:39,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:39,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:34:39,781 INFO L87 Difference]: Start difference. First operand 9732 states and 12778 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 01:34:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:40,683 INFO L93 Difference]: Finished difference Result 12501 states and 16262 transitions. [2023-12-19 01:34:40,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 01:34:40,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2023-12-19 01:34:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:40,708 INFO L225 Difference]: With dead ends: 12501 [2023-12-19 01:34:40,708 INFO L226 Difference]: Without dead ends: 6289 [2023-12-19 01:34:40,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:34:40,726 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 612 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:40,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 511 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:34:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2023-12-19 01:34:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 5335. [2023-12-19 01:34:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5335 states, 4239 states have (on average 1.3706062750648738) internal successors, (5810), 4312 states have internal predecessors, (5810), 591 states have call successors, (591), 433 states have call predecessors, (591), 503 states have return successors, (842), 599 states have call predecessors, (842), 588 states have call successors, (842) [2023-12-19 01:34:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5335 states to 5335 states and 7243 transitions. [2023-12-19 01:34:41,252 INFO L78 Accepts]: Start accepts. Automaton has 5335 states and 7243 transitions. Word has length 71 [2023-12-19 01:34:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:41,253 INFO L495 AbstractCegarLoop]: Abstraction has 5335 states and 7243 transitions. [2023-12-19 01:34:41,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-19 01:34:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5335 states and 7243 transitions. [2023-12-19 01:34:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-19 01:34:41,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:41,256 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:41,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 01:34:41,256 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:41,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash 178274904, now seen corresponding path program 1 times [2023-12-19 01:34:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31896898] [2023-12-19 01:34:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:41,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:41,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:41,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:41,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 01:34:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 01:34:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31896898] [2023-12-19 01:34:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31896898] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:41,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:34:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465381804] [2023-12-19 01:34:41,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:41,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:34:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:41,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:34:41,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:34:41,358 INFO L87 Difference]: Start difference. First operand 5335 states and 7243 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:34:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:42,779 INFO L93 Difference]: Finished difference Result 10602 states and 13710 transitions. [2023-12-19 01:34:42,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-19 01:34:42,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2023-12-19 01:34:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:42,809 INFO L225 Difference]: With dead ends: 10602 [2023-12-19 01:34:42,809 INFO L226 Difference]: Without dead ends: 7117 [2023-12-19 01:34:42,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-12-19 01:34:42,823 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 676 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:42,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 898 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:34:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2023-12-19 01:34:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 6886. [2023-12-19 01:34:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6886 states, 5387 states have (on average 1.3304250974568406) internal successors, (7167), 5497 states have internal predecessors, (7167), 775 states have call successors, (775), 591 states have call predecessors, (775), 722 states have return successors, (1163), 807 states have call predecessors, (1163), 772 states have call successors, (1163) [2023-12-19 01:34:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 9105 transitions. [2023-12-19 01:34:43,468 INFO L78 Accepts]: Start accepts. Automaton has 6886 states and 9105 transitions. Word has length 76 [2023-12-19 01:34:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:43,469 INFO L495 AbstractCegarLoop]: Abstraction has 6886 states and 9105 transitions. [2023-12-19 01:34:43,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:34:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6886 states and 9105 transitions. [2023-12-19 01:34:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 01:34:43,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:43,475 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:43,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 01:34:43,475 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:43,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1670249923, now seen corresponding path program 1 times [2023-12-19 01:34:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:43,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608789878] [2023-12-19 01:34:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:43,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:43,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:43,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:43,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-19 01:34:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 01:34:43,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:43,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608789878] [2023-12-19 01:34:43,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608789878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:43,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:43,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:34:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151264047] [2023-12-19 01:34:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:43,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:34:43,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:34:43,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:34:43,598 INFO L87 Difference]: Start difference. First operand 6886 states and 9105 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:34:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:44,907 INFO L93 Difference]: Finished difference Result 9536 states and 12360 transitions. [2023-12-19 01:34:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 01:34:44,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2023-12-19 01:34:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:44,931 INFO L225 Difference]: With dead ends: 9536 [2023-12-19 01:34:44,931 INFO L226 Difference]: Without dead ends: 6042 [2023-12-19 01:34:44,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-12-19 01:34:44,942 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1300 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:44,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 754 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:34:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2023-12-19 01:34:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 5680. [2023-12-19 01:34:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 4465 states have (on average 1.342889137737962) internal successors, (5996), 4558 states have internal predecessors, (5996), 633 states have call successors, (633), 467 states have call predecessors, (633), 580 states have return successors, (928), 664 states have call predecessors, (928), 630 states have call successors, (928) [2023-12-19 01:34:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 7557 transitions. [2023-12-19 01:34:45,601 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 7557 transitions. Word has length 86 [2023-12-19 01:34:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:45,602 INFO L495 AbstractCegarLoop]: Abstraction has 5680 states and 7557 transitions. [2023-12-19 01:34:45,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:34:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 7557 transitions. [2023-12-19 01:34:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 01:34:45,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:45,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:45,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 01:34:45,609 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:45,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1026383218, now seen corresponding path program 1 times [2023-12-19 01:34:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542113780] [2023-12-19 01:34:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:34:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 01:34:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-19 01:34:45,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542113780] [2023-12-19 01:34:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542113780] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345865450] [2023-12-19 01:34:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:45,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:45,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:45,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 01:34:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:45,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:34:45,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:34:45,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:45,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345865450] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:45,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:45,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:34:45,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417060275] [2023-12-19 01:34:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:45,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:45,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:45,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:45,840 INFO L87 Difference]: Start difference. First operand 5680 states and 7557 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:46,345 INFO L93 Difference]: Finished difference Result 8563 states and 12031 transitions. [2023-12-19 01:34:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:34:46,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 100 [2023-12-19 01:34:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:46,372 INFO L225 Difference]: With dead ends: 8563 [2023-12-19 01:34:46,372 INFO L226 Difference]: Without dead ends: 7056 [2023-12-19 01:34:46,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:46,381 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 133 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:46,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 689 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:34:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7056 states. [2023-12-19 01:34:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7056 to 7051. [2023-12-19 01:34:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7051 states, 5594 states have (on average 1.3671791204862354) internal successors, (7648), 5699 states have internal predecessors, (7648), 773 states have call successors, (773), 555 states have call predecessors, (773), 682 states have return successors, (1248), 806 states have call predecessors, (1248), 770 states have call successors, (1248) [2023-12-19 01:34:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 9669 transitions. [2023-12-19 01:34:46,997 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 9669 transitions. Word has length 100 [2023-12-19 01:34:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:46,997 INFO L495 AbstractCegarLoop]: Abstraction has 7051 states and 9669 transitions. [2023-12-19 01:34:46,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:34:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 9669 transitions. [2023-12-19 01:34:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-19 01:34:47,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:47,008 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:47,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-19 01:34:47,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-19 01:34:47,217 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:47,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:47,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1644455643, now seen corresponding path program 1 times [2023-12-19 01:34:47,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:47,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910547986] [2023-12-19 01:34:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 01:34:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:34:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:34:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 01:34:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 01:34:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-19 01:34:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 01:34:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-19 01:34:47,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:47,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910547986] [2023-12-19 01:34:47,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910547986] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:47,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952631713] [2023-12-19 01:34:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:47,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:47,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:47,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:47,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 01:34:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:47,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 01:34:47,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-19 01:34:47,545 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:47,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952631713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:47,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:47,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-12-19 01:34:47,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516348741] [2023-12-19 01:34:47,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:47,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:34:47,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:47,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:34:47,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-19 01:34:47,547 INFO L87 Difference]: Start difference. First operand 7051 states and 9669 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 01:34:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:48,114 INFO L93 Difference]: Finished difference Result 8587 states and 11539 transitions. [2023-12-19 01:34:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:34:48,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-12-19 01:34:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:48,136 INFO L225 Difference]: With dead ends: 8587 [2023-12-19 01:34:48,136 INFO L226 Difference]: Without dead ends: 5627 [2023-12-19 01:34:48,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-19 01:34:48,144 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 32 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:48,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1379 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 01:34:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2023-12-19 01:34:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 5505. [2023-12-19 01:34:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5505 states, 4490 states have (on average 1.4060133630289533) internal successors, (6313), 4556 states have internal predecessors, (6313), 565 states have call successors, (565), 372 states have call predecessors, (565), 448 states have return successors, (954), 584 states have call predecessors, (954), 562 states have call successors, (954) [2023-12-19 01:34:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5505 states to 5505 states and 7832 transitions. [2023-12-19 01:34:48,527 INFO L78 Accepts]: Start accepts. Automaton has 5505 states and 7832 transitions. Word has length 131 [2023-12-19 01:34:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:48,527 INFO L495 AbstractCegarLoop]: Abstraction has 5505 states and 7832 transitions. [2023-12-19 01:34:48,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 01:34:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5505 states and 7832 transitions. [2023-12-19 01:34:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 01:34:48,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:48,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:48,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:48,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:48,745 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:48,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:48,746 INFO L85 PathProgramCache]: Analyzing trace with hash 205850875, now seen corresponding path program 1 times [2023-12-19 01:34:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:48,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731494212] [2023-12-19 01:34:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:34:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-19 01:34:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-19 01:34:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-19 01:34:48,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:48,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731494212] [2023-12-19 01:34:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731494212] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958792380] [2023-12-19 01:34:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:48,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:48,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:48,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:48,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 01:34:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:48,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:34:48,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-19 01:34:49,093 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:49,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958792380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:49,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:49,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:34:49,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284230809] [2023-12-19 01:34:49,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:49,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:49,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:49,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:49,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:49,095 INFO L87 Difference]: Start difference. First operand 5505 states and 7832 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:34:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:49,643 INFO L93 Difference]: Finished difference Result 10278 states and 15182 transitions. [2023-12-19 01:34:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:34:49,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2023-12-19 01:34:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:49,665 INFO L225 Difference]: With dead ends: 10278 [2023-12-19 01:34:49,665 INFO L226 Difference]: Without dead ends: 7400 [2023-12-19 01:34:49,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:49,677 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 220 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:49,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 430 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7400 states. [2023-12-19 01:34:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7400 to 7362. [2023-12-19 01:34:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7362 states, 6033 states have (on average 1.4238355710260235) internal successors, (8590), 6120 states have internal predecessors, (8590), 747 states have call successors, (747), 488 states have call predecessors, (747), 580 states have return successors, (1243), 761 states have call predecessors, (1243), 744 states have call successors, (1243) [2023-12-19 01:34:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7362 states to 7362 states and 10580 transitions. [2023-12-19 01:34:50,237 INFO L78 Accepts]: Start accepts. Automaton has 7362 states and 10580 transitions. Word has length 128 [2023-12-19 01:34:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:50,237 INFO L495 AbstractCegarLoop]: Abstraction has 7362 states and 10580 transitions. [2023-12-19 01:34:50,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:34:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 7362 states and 10580 transitions. [2023-12-19 01:34:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 01:34:50,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:50,248 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:50,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:50,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:50,455 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:50,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1124825498, now seen corresponding path program 1 times [2023-12-19 01:34:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549586815] [2023-12-19 01:34:50,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:34:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-19 01:34:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-19 01:34:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-19 01:34:50,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:50,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549586815] [2023-12-19 01:34:50,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549586815] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:50,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386361363] [2023-12-19 01:34:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:50,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:50,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:50,551 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:50,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 01:34:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:50,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:34:50,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:34:50,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:50,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386361363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:50,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:50,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-19 01:34:50,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47543895] [2023-12-19 01:34:50,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:50,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:50,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:50,769 INFO L87 Difference]: Start difference. First operand 7362 states and 10580 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:34:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:51,711 INFO L93 Difference]: Finished difference Result 18990 states and 28296 transitions. [2023-12-19 01:34:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:34:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2023-12-19 01:34:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:51,765 INFO L225 Difference]: With dead ends: 18990 [2023-12-19 01:34:51,765 INFO L226 Difference]: Without dead ends: 13062 [2023-12-19 01:34:51,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:51,791 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 224 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:51,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 429 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13062 states. [2023-12-19 01:34:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13062 to 12995. [2023-12-19 01:34:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12995 states, 10700 states have (on average 1.439252336448598) internal successors, (15400), 10859 states have internal predecessors, (15400), 1297 states have call successors, (1297), 847 states have call predecessors, (1297), 996 states have return successors, (2151), 1296 states have call predecessors, (2151), 1294 states have call successors, (2151) [2023-12-19 01:34:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12995 states to 12995 states and 18848 transitions. [2023-12-19 01:34:52,698 INFO L78 Accepts]: Start accepts. Automaton has 12995 states and 18848 transitions. Word has length 128 [2023-12-19 01:34:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:52,698 INFO L495 AbstractCegarLoop]: Abstraction has 12995 states and 18848 transitions. [2023-12-19 01:34:52,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-19 01:34:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12995 states and 18848 transitions. [2023-12-19 01:34:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:34:52,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:52,713 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:52,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:52,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-19 01:34:52,921 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:52,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:52,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2069395970, now seen corresponding path program 1 times [2023-12-19 01:34:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:52,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126272333] [2023-12-19 01:34:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:52,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:34:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:34:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 01:34:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 01:34:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 01:34:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-19 01:34:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-19 01:34:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-19 01:34:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:53,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126272333] [2023-12-19 01:34:53,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126272333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:53,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:34:53,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:34:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445829061] [2023-12-19 01:34:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:53,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:34:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:34:53,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:53,043 INFO L87 Difference]: Start difference. First operand 12995 states and 18848 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-19 01:34:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:54,260 INFO L93 Difference]: Finished difference Result 14162 states and 20252 transitions. [2023-12-19 01:34:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 01:34:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2023-12-19 01:34:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:54,295 INFO L225 Difference]: With dead ends: 14162 [2023-12-19 01:34:54,295 INFO L226 Difference]: Without dead ends: 12903 [2023-12-19 01:34:54,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:54,299 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 378 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:54,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 746 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 01:34:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12903 states. [2023-12-19 01:34:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12903 to 12764. [2023-12-19 01:34:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12764 states, 10520 states have (on average 1.444106463878327) internal successors, (15192), 10679 states have internal predecessors, (15192), 1272 states have call successors, (1272), 826 states have call predecessors, (1272), 970 states have return successors, (2113), 1266 states have call predecessors, (2113), 1269 states have call successors, (2113) [2023-12-19 01:34:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12764 states to 12764 states and 18577 transitions. [2023-12-19 01:34:54,999 INFO L78 Accepts]: Start accepts. Automaton has 12764 states and 18577 transitions. Word has length 145 [2023-12-19 01:34:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:54,999 INFO L495 AbstractCegarLoop]: Abstraction has 12764 states and 18577 transitions. [2023-12-19 01:34:54,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-19 01:34:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 12764 states and 18577 transitions. [2023-12-19 01:34:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 01:34:55,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:55,014 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:55,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 01:34:55,014 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:55,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2105371629, now seen corresponding path program 1 times [2023-12-19 01:34:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:55,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674243221] [2023-12-19 01:34:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:55,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:34:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:34:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:34:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 01:34:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:34:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 01:34:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 01:34:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:34:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:34:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-19 01:34:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-19 01:34:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-19 01:34:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-19 01:34:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674243221] [2023-12-19 01:34:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674243221] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987092800] [2023-12-19 01:34:55,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:55,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:55,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:55,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:55,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 01:34:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:55,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-19 01:34:55,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-19 01:34:55,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:55,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987092800] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:55,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:55,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-12-19 01:34:55,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473474009] [2023-12-19 01:34:55,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:55,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:34:55,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:55,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:34:55,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:34:55,525 INFO L87 Difference]: Start difference. First operand 12764 states and 18577 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 01:34:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:56,420 INFO L93 Difference]: Finished difference Result 14874 states and 21169 transitions. [2023-12-19 01:34:56,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 01:34:56,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2023-12-19 01:34:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:56,456 INFO L225 Difference]: With dead ends: 14874 [2023-12-19 01:34:56,456 INFO L226 Difference]: Without dead ends: 13592 [2023-12-19 01:34:56,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-19 01:34:56,464 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 167 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:56,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 449 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:34:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13592 states. [2023-12-19 01:34:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13592 to 13553. [2023-12-19 01:34:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13553 states, 11166 states have (on average 1.4279061436503673) internal successors, (15944), 11329 states have internal predecessors, (15944), 1342 states have call successors, (1342), 877 states have call predecessors, (1342), 1043 states have return successors, (2224), 1354 states have call predecessors, (2224), 1339 states have call successors, (2224) [2023-12-19 01:34:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13553 states to 13553 states and 19510 transitions. [2023-12-19 01:34:57,268 INFO L78 Accepts]: Start accepts. Automaton has 13553 states and 19510 transitions. Word has length 147 [2023-12-19 01:34:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:57,269 INFO L495 AbstractCegarLoop]: Abstraction has 13553 states and 19510 transitions. [2023-12-19 01:34:57,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 01:34:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 13553 states and 19510 transitions. [2023-12-19 01:34:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 01:34:57,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:57,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:57,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:57,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-19 01:34:57,486 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:57,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1177006764, now seen corresponding path program 1 times [2023-12-19 01:34:57,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:57,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58550762] [2023-12-19 01:34:57,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:57,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:34:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:34:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 01:34:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-19 01:34:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 01:34:57,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:57,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58550762] [2023-12-19 01:34:57,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58550762] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:57,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43494886] [2023-12-19 01:34:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:57,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:57,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:57,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:57,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 01:34:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:57,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:34:57,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-19 01:34:57,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43494886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:57,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:57,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:34:57,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522494902] [2023-12-19 01:34:57,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:57,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:57,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:57,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:57,778 INFO L87 Difference]: Start difference. First operand 13553 states and 19510 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:34:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:34:58,579 INFO L93 Difference]: Finished difference Result 23548 states and 34581 transitions. [2023-12-19 01:34:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:34:58,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2023-12-19 01:34:58,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:34:58,610 INFO L225 Difference]: With dead ends: 23548 [2023-12-19 01:34:58,611 INFO L226 Difference]: Without dead ends: 13018 [2023-12-19 01:34:58,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:58,639 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 242 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:34:58,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 303 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:34:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13018 states. [2023-12-19 01:34:59,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13018 to 10497. [2023-12-19 01:34:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10497 states, 8655 states have (on average 1.3734257654534952) internal successors, (11887), 8754 states have internal predecessors, (11887), 1019 states have call successors, (1019), 707 states have call predecessors, (1019), 821 states have return successors, (1608), 1039 states have call predecessors, (1608), 1016 states have call successors, (1608) [2023-12-19 01:34:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10497 states to 10497 states and 14514 transitions. [2023-12-19 01:34:59,374 INFO L78 Accepts]: Start accepts. Automaton has 10497 states and 14514 transitions. Word has length 144 [2023-12-19 01:34:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:34:59,374 INFO L495 AbstractCegarLoop]: Abstraction has 10497 states and 14514 transitions. [2023-12-19 01:34:59,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:34:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 10497 states and 14514 transitions. [2023-12-19 01:34:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 01:34:59,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:34:59,391 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:34:59,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 01:34:59,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:59,600 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:34:59,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:34:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 815270839, now seen corresponding path program 1 times [2023-12-19 01:34:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:34:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244301002] [2023-12-19 01:34:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:34:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:34:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:34:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:34:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:34:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:34:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 01:34:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 01:34:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:34:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:34:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-19 01:34:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 01:34:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:34:59,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244301002] [2023-12-19 01:34:59,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244301002] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:34:59,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38894893] [2023-12-19 01:34:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:34:59,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:34:59,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:34:59,708 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:34:59,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 01:34:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:34:59,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:34:59,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:34:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-19 01:34:59,860 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:34:59,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38894893] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:34:59,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:34:59,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:34:59,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160601605] [2023-12-19 01:34:59,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:34:59,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:34:59,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:34:59,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:34:59,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:34:59,862 INFO L87 Difference]: Start difference. First operand 10497 states and 14514 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:35:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:00,480 INFO L93 Difference]: Finished difference Result 19773 states and 27769 transitions. [2023-12-19 01:35:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:35:00,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 144 [2023-12-19 01:35:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:00,505 INFO L225 Difference]: With dead ends: 19773 [2023-12-19 01:35:00,505 INFO L226 Difference]: Without dead ends: 11269 [2023-12-19 01:35:00,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:00,520 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 242 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:00,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 428 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2023-12-19 01:35:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 11213. [2023-12-19 01:35:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11213 states, 9294 states have (on average 1.3489347966429954) internal successors, (12537), 9393 states have internal predecessors, (12537), 1033 states have call successors, (1033), 763 states have call predecessors, (1033), 884 states have return successors, (1748), 1060 states have call predecessors, (1748), 1030 states have call successors, (1748) [2023-12-19 01:35:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11213 states to 11213 states and 15318 transitions. [2023-12-19 01:35:01,203 INFO L78 Accepts]: Start accepts. Automaton has 11213 states and 15318 transitions. Word has length 144 [2023-12-19 01:35:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:01,203 INFO L495 AbstractCegarLoop]: Abstraction has 11213 states and 15318 transitions. [2023-12-19 01:35:01,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:35:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 11213 states and 15318 transitions. [2023-12-19 01:35:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-19 01:35:01,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:01,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:01,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:01,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-19 01:35:01,413 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:01,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1899172420, now seen corresponding path program 1 times [2023-12-19 01:35:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:01,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000049088] [2023-12-19 01:35:01,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:35:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:35:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:35:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-19 01:35:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 01:35:01,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:01,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000049088] [2023-12-19 01:35:01,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000049088] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:01,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089763707] [2023-12-19 01:35:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:01,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:01,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:01,520 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:01,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 01:35:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:01,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:35:01,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 01:35:01,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:01,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089763707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:01,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:01,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:35:01,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735650442] [2023-12-19 01:35:01,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:01,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:35:01,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:01,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:35:01,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:01,657 INFO L87 Difference]: Start difference. First operand 11213 states and 15318 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:02,699 INFO L93 Difference]: Finished difference Result 28425 states and 40233 transitions. [2023-12-19 01:35:02,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:35:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2023-12-19 01:35:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:02,749 INFO L225 Difference]: With dead ends: 28425 [2023-12-19 01:35:02,749 INFO L226 Difference]: Without dead ends: 19205 [2023-12-19 01:35:02,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:02,774 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 145 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:02,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 702 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19205 states. [2023-12-19 01:35:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19205 to 19201. [2023-12-19 01:35:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19201 states, 15907 states have (on average 1.3535550386622242) internal successors, (21531), 16087 states have internal predecessors, (21531), 1801 states have call successors, (1801), 1304 states have call predecessors, (1801), 1491 states have return successors, (3731), 1817 states have call predecessors, (3731), 1798 states have call successors, (3731) [2023-12-19 01:35:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19201 states to 19201 states and 27063 transitions. [2023-12-19 01:35:03,980 INFO L78 Accepts]: Start accepts. Automaton has 19201 states and 27063 transitions. Word has length 145 [2023-12-19 01:35:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:03,981 INFO L495 AbstractCegarLoop]: Abstraction has 19201 states and 27063 transitions. [2023-12-19 01:35:03,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 19201 states and 27063 transitions. [2023-12-19 01:35:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:35:03,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:03,993 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:04,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:04,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:04,194 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:04,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash 24988096, now seen corresponding path program 1 times [2023-12-19 01:35:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:04,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622554637] [2023-12-19 01:35:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:35:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:35:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:35:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:35:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-19 01:35:04,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:04,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622554637] [2023-12-19 01:35:04,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622554637] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:04,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551060467] [2023-12-19 01:35:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:04,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:04,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:04,297 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:04,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-19 01:35:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:04,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:35:04,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-19 01:35:04,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551060467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:04,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:04,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:35:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912843528] [2023-12-19 01:35:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:04,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:35:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:35:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:04,458 INFO L87 Difference]: Start difference. First operand 19201 states and 27063 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:05,538 INFO L93 Difference]: Finished difference Result 36435 states and 52788 transitions. [2023-12-19 01:35:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:35:05,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 146 [2023-12-19 01:35:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:05,585 INFO L225 Difference]: With dead ends: 36435 [2023-12-19 01:35:05,585 INFO L226 Difference]: Without dead ends: 19891 [2023-12-19 01:35:05,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:05,613 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 261 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:05,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 307 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19891 states. [2023-12-19 01:35:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19891 to 18321. [2023-12-19 01:35:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18321 states, 15171 states have (on average 1.3170522707797772) internal successors, (19981), 15325 states have internal predecessors, (19981), 1729 states have call successors, (1729), 1244 states have call predecessors, (1729), 1419 states have return successors, (3178), 1755 states have call predecessors, (3178), 1726 states have call successors, (3178) [2023-12-19 01:35:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18321 states to 18321 states and 24888 transitions. [2023-12-19 01:35:06,738 INFO L78 Accepts]: Start accepts. Automaton has 18321 states and 24888 transitions. Word has length 146 [2023-12-19 01:35:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:06,739 INFO L495 AbstractCegarLoop]: Abstraction has 18321 states and 24888 transitions. [2023-12-19 01:35:06,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 18321 states and 24888 transitions. [2023-12-19 01:35:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:35:06,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:06,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:06,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-19 01:35:06,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-12-19 01:35:06,951 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:06,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash -162275649, now seen corresponding path program 1 times [2023-12-19 01:35:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:06,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374955733] [2023-12-19 01:35:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 01:35:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 01:35:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 01:35:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:35:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-19 01:35:07,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:07,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374955733] [2023-12-19 01:35:07,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374955733] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:07,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142282754] [2023-12-19 01:35:07,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:07,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:07,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:07,046 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:07,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 01:35:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:07,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:35:07,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-19 01:35:07,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142282754] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:07,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:07,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:35:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460501329] [2023-12-19 01:35:07,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:07,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:35:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:07,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:35:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:07,176 INFO L87 Difference]: Start difference. First operand 18321 states and 24888 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:09,098 INFO L93 Difference]: Finished difference Result 49954 states and 69553 transitions. [2023-12-19 01:35:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:35:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 146 [2023-12-19 01:35:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:09,195 INFO L225 Difference]: With dead ends: 49954 [2023-12-19 01:35:09,196 INFO L226 Difference]: Without dead ends: 33630 [2023-12-19 01:35:09,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:09,225 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 151 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:09,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 691 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33630 states. [2023-12-19 01:35:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33630 to 33626. [2023-12-19 01:35:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33626 states, 27942 states have (on average 1.3123613198768878) internal successors, (36670), 28232 states have internal predecessors, (36670), 3139 states have call successors, (3139), 2276 states have call predecessors, (3139), 2543 states have return successors, (6792), 3125 states have call predecessors, (6792), 3136 states have call successors, (6792) [2023-12-19 01:35:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33626 states to 33626 states and 46601 transitions. [2023-12-19 01:35:11,335 INFO L78 Accepts]: Start accepts. Automaton has 33626 states and 46601 transitions. Word has length 146 [2023-12-19 01:35:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:11,336 INFO L495 AbstractCegarLoop]: Abstraction has 33626 states and 46601 transitions. [2023-12-19 01:35:11,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 33626 states and 46601 transitions. [2023-12-19 01:35:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:35:11,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:11,358 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:11,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:11,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-12-19 01:35:11,567 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:11,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash -610348148, now seen corresponding path program 1 times [2023-12-19 01:35:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:11,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886468217] [2023-12-19 01:35:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:11,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:35:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:35:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 01:35:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:35:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-19 01:35:11,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:11,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886468217] [2023-12-19 01:35:11,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886468217] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:11,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241021180] [2023-12-19 01:35:11,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:11,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:11,678 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:11,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-19 01:35:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:11,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:35:11,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-19 01:35:11,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:11,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241021180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:11,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:11,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:35:11,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078650836] [2023-12-19 01:35:11,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:11,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:35:11,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:11,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:35:11,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:11,827 INFO L87 Difference]: Start difference. First operand 33626 states and 46601 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:35:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:14,148 INFO L93 Difference]: Finished difference Result 60180 states and 84013 transitions. [2023-12-19 01:35:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:35:14,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 146 [2023-12-19 01:35:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:14,245 INFO L225 Difference]: With dead ends: 60180 [2023-12-19 01:35:14,245 INFO L226 Difference]: Without dead ends: 35512 [2023-12-19 01:35:14,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:14,292 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 256 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:14,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 449 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2023-12-19 01:35:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 35196. [2023-12-19 01:35:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35196 states, 29420 states have (on average 1.303704962610469) internal successors, (38355), 29738 states have internal predecessors, (38355), 3139 states have call successors, (3139), 2340 states have call predecessors, (3139), 2635 states have return successors, (7056), 3125 states have call predecessors, (7056), 3136 states have call successors, (7056) [2023-12-19 01:35:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35196 states to 35196 states and 48550 transitions. [2023-12-19 01:35:16,579 INFO L78 Accepts]: Start accepts. Automaton has 35196 states and 48550 transitions. Word has length 146 [2023-12-19 01:35:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:16,580 INFO L495 AbstractCegarLoop]: Abstraction has 35196 states and 48550 transitions. [2023-12-19 01:35:16,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:35:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 35196 states and 48550 transitions. [2023-12-19 01:35:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 01:35:16,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:16,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:16,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:16,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-19 01:35:16,817 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:16,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash 608475726, now seen corresponding path program 1 times [2023-12-19 01:35:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118897650] [2023-12-19 01:35:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:35:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:35:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 01:35:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 01:35:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-19 01:35:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:16,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118897650] [2023-12-19 01:35:16,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118897650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:16,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:35:16,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:35:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145051661] [2023-12-19 01:35:16,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:16,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:35:16,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:16,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:35:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:35:16,979 INFO L87 Difference]: Start difference. First operand 35196 states and 48550 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:35:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:19,226 INFO L93 Difference]: Finished difference Result 69430 states and 95500 transitions. [2023-12-19 01:35:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:35:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 146 [2023-12-19 01:35:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:19,317 INFO L225 Difference]: With dead ends: 69430 [2023-12-19 01:35:19,318 INFO L226 Difference]: Without dead ends: 36229 [2023-12-19 01:35:19,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:35:19,356 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 381 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:19,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 437 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:35:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36229 states. [2023-12-19 01:35:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36229 to 32628. [2023-12-19 01:35:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32628 states, 27475 states have (on average 1.3048589626933575) internal successors, (35851), 28097 states have internal predecessors, (35851), 2493 states have call successors, (2493), 1864 states have call predecessors, (2493), 2658 states have return successors, (6516), 2670 states have call predecessors, (6516), 2490 states have call successors, (6516) [2023-12-19 01:35:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32628 states to 32628 states and 44860 transitions. [2023-12-19 01:35:21,582 INFO L78 Accepts]: Start accepts. Automaton has 32628 states and 44860 transitions. Word has length 146 [2023-12-19 01:35:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:21,582 INFO L495 AbstractCegarLoop]: Abstraction has 32628 states and 44860 transitions. [2023-12-19 01:35:21,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:35:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 32628 states and 44860 transitions. [2023-12-19 01:35:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 01:35:21,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:21,600 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:21,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-19 01:35:21,601 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:21,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:21,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1159576366, now seen corresponding path program 1 times [2023-12-19 01:35:21,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:21,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405020271] [2023-12-19 01:35:21,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:21,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:35:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:35:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:35:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-19 01:35:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-19 01:35:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405020271] [2023-12-19 01:35:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405020271] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098522708] [2023-12-19 01:35:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:21,704 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:21,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-19 01:35:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:21,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:35:21,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-19 01:35:21,858 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098522708] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:21,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:21,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:35:21,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829284593] [2023-12-19 01:35:21,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:21,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:35:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:21,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:35:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:21,860 INFO L87 Difference]: Start difference. First operand 32628 states and 44860 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:35:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:23,856 INFO L93 Difference]: Finished difference Result 56073 states and 77522 transitions. [2023-12-19 01:35:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:35:23,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 147 [2023-12-19 01:35:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:24,005 INFO L225 Difference]: With dead ends: 56073 [2023-12-19 01:35:24,005 INFO L226 Difference]: Without dead ends: 32968 [2023-12-19 01:35:24,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:24,030 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 257 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:24,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 452 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32968 states. [2023-12-19 01:35:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32968 to 32628. [2023-12-19 01:35:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32628 states, 27475 states have (on average 1.2994358507734305) internal successors, (35702), 28097 states have internal predecessors, (35702), 2493 states have call successors, (2493), 1864 states have call predecessors, (2493), 2658 states have return successors, (6516), 2670 states have call predecessors, (6516), 2490 states have call successors, (6516) [2023-12-19 01:35:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32628 states to 32628 states and 44711 transitions. [2023-12-19 01:35:26,180 INFO L78 Accepts]: Start accepts. Automaton has 32628 states and 44711 transitions. Word has length 147 [2023-12-19 01:35:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:26,181 INFO L495 AbstractCegarLoop]: Abstraction has 32628 states and 44711 transitions. [2023-12-19 01:35:26,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 01:35:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32628 states and 44711 transitions. [2023-12-19 01:35:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 01:35:26,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:26,196 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:26,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:26,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-12-19 01:35:26,397 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:26,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash -203733610, now seen corresponding path program 1 times [2023-12-19 01:35:26,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:26,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457701831] [2023-12-19 01:35:26,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:26,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-19 01:35:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 01:35:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 01:35:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-19 01:35:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-19 01:35:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:26,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457701831] [2023-12-19 01:35:26,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457701831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:26,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:35:26,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:35:26,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389807463] [2023-12-19 01:35:26,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:26,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:35:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:26,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:35:26,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:35:26,470 INFO L87 Difference]: Start difference. First operand 32628 states and 44711 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:35:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:28,502 INFO L93 Difference]: Finished difference Result 58134 states and 79532 transitions. [2023-12-19 01:35:28,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 01:35:28,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 147 [2023-12-19 01:35:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:28,588 INFO L225 Difference]: With dead ends: 58134 [2023-12-19 01:35:28,588 INFO L226 Difference]: Without dead ends: 27498 [2023-12-19 01:35:28,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:35:28,631 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 379 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:28,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 435 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:35:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27498 states. [2023-12-19 01:35:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27498 to 24578. [2023-12-19 01:35:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24578 states, 20725 states have (on average 1.3080820265379975) internal successors, (27110), 21160 states have internal predecessors, (27110), 1877 states have call successors, (1877), 1412 states have call predecessors, (1877), 1974 states have return successors, (4556), 2007 states have call predecessors, (4556), 1874 states have call successors, (4556) [2023-12-19 01:35:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24578 states to 24578 states and 33543 transitions. [2023-12-19 01:35:30,241 INFO L78 Accepts]: Start accepts. Automaton has 24578 states and 33543 transitions. Word has length 147 [2023-12-19 01:35:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:30,242 INFO L495 AbstractCegarLoop]: Abstraction has 24578 states and 33543 transitions. [2023-12-19 01:35:30,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-19 01:35:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 24578 states and 33543 transitions. [2023-12-19 01:35:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 01:35:30,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:30,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:30,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-19 01:35:30,257 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:30,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2013377300, now seen corresponding path program 1 times [2023-12-19 01:35:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037273335] [2023-12-19 01:35:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:35:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:35:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:35:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-19 01:35:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-19 01:35:30,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:30,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037273335] [2023-12-19 01:35:30,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037273335] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:30,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425057686] [2023-12-19 01:35:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:30,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:30,364 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:30,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-19 01:35:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:30,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:35:30,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 01:35:30,635 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:30,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425057686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:30,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:30,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:35:30,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683460481] [2023-12-19 01:35:30,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:30,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:35:30,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:30,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:35:30,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:30,637 INFO L87 Difference]: Start difference. First operand 24578 states and 33543 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:32,093 INFO L93 Difference]: Finished difference Result 39441 states and 56728 transitions. [2023-12-19 01:35:32,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:35:32,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 150 [2023-12-19 01:35:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:32,261 INFO L225 Difference]: With dead ends: 39441 [2023-12-19 01:35:32,261 INFO L226 Difference]: Without dead ends: 24638 [2023-12-19 01:35:32,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:32,285 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 131 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:32,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 653 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24638 states. [2023-12-19 01:35:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24638 to 24578. [2023-12-19 01:35:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24578 states, 20725 states have (on average 1.2827020506634499) internal successors, (26584), 21160 states have internal predecessors, (26584), 1877 states have call successors, (1877), 1412 states have call predecessors, (1877), 1974 states have return successors, (4556), 2007 states have call predecessors, (4556), 1874 states have call successors, (4556) [2023-12-19 01:35:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24578 states to 24578 states and 33017 transitions. [2023-12-19 01:35:33,825 INFO L78 Accepts]: Start accepts. Automaton has 24578 states and 33017 transitions. Word has length 150 [2023-12-19 01:35:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:33,826 INFO L495 AbstractCegarLoop]: Abstraction has 24578 states and 33017 transitions. [2023-12-19 01:35:33,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 24578 states and 33017 transitions. [2023-12-19 01:35:33,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 01:35:33,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:33,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:33,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:34,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:34,040 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:34,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:34,041 INFO L85 PathProgramCache]: Analyzing trace with hash 800787724, now seen corresponding path program 1 times [2023-12-19 01:35:34,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:34,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510858220] [2023-12-19 01:35:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:34,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:35:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:35:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 01:35:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-19 01:35:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-19 01:35:34,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510858220] [2023-12-19 01:35:34,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510858220] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046339519] [2023-12-19 01:35:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:34,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:34,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:34,134 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:34,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-19 01:35:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:34,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 01:35:34,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-19 01:35:34,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046339519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:35:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747501979] [2023-12-19 01:35:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:34,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:35:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:35:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:34,304 INFO L87 Difference]: Start difference. First operand 24578 states and 33017 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:35:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:35,903 INFO L93 Difference]: Finished difference Result 47665 states and 66342 transitions. [2023-12-19 01:35:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:35:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 150 [2023-12-19 01:35:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:35,971 INFO L225 Difference]: With dead ends: 47665 [2023-12-19 01:35:35,971 INFO L226 Difference]: Without dead ends: 25080 [2023-12-19 01:35:36,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:36,007 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 248 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:36,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 296 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25080 states. [2023-12-19 01:35:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25080 to 20812. [2023-12-19 01:35:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20812 states, 17574 states have (on average 1.2482075793786276) internal successors, (21936), 17943 states have internal predecessors, (21936), 1561 states have call successors, (1561), 1188 states have call predecessors, (1561), 1675 states have return successors, (3312), 1682 states have call predecessors, (3312), 1558 states have call successors, (3312) [2023-12-19 01:35:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20812 states to 20812 states and 26809 transitions. [2023-12-19 01:35:37,312 INFO L78 Accepts]: Start accepts. Automaton has 20812 states and 26809 transitions. Word has length 150 [2023-12-19 01:35:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:37,312 INFO L495 AbstractCegarLoop]: Abstraction has 20812 states and 26809 transitions. [2023-12-19 01:35:37,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-19 01:35:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20812 states and 26809 transitions. [2023-12-19 01:35:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-19 01:35:37,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:37,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:37,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:37,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-12-19 01:35:37,526 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:37,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:37,526 INFO L85 PathProgramCache]: Analyzing trace with hash 874362032, now seen corresponding path program 1 times [2023-12-19 01:35:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:37,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806283973] [2023-12-19 01:35:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:35:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:35:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:35:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-19 01:35:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-19 01:35:37,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:37,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806283973] [2023-12-19 01:35:37,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806283973] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963742516] [2023-12-19 01:35:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:37,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:37,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:37,626 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:37,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-19 01:35:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:37,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 01:35:37,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-19 01:35:37,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:37,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963742516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:37,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:37,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-19 01:35:37,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463909457] [2023-12-19 01:35:37,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:37,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 01:35:37,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:37,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 01:35:37,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:37,804 INFO L87 Difference]: Start difference. First operand 20812 states and 26809 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:39,157 INFO L93 Difference]: Finished difference Result 33324 states and 44759 transitions. [2023-12-19 01:35:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 01:35:39,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 151 [2023-12-19 01:35:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:39,214 INFO L225 Difference]: With dead ends: 33324 [2023-12-19 01:35:39,214 INFO L226 Difference]: Without dead ends: 20454 [2023-12-19 01:35:39,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:39,235 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 108 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:39,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 616 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20454 states. [2023-12-19 01:35:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20454 to 20284. [2023-12-19 01:35:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20284 states, 17112 states have (on average 1.2232351566152408) internal successors, (20932), 17448 states have internal predecessors, (20932), 1561 states have call successors, (1561), 1188 states have call predecessors, (1561), 1609 states have return successors, (3208), 1649 states have call predecessors, (3208), 1558 states have call successors, (3208) [2023-12-19 01:35:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20284 states to 20284 states and 25701 transitions. [2023-12-19 01:35:40,501 INFO L78 Accepts]: Start accepts. Automaton has 20284 states and 25701 transitions. Word has length 151 [2023-12-19 01:35:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:40,501 INFO L495 AbstractCegarLoop]: Abstraction has 20284 states and 25701 transitions. [2023-12-19 01:35:40,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-19 01:35:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 20284 states and 25701 transitions. [2023-12-19 01:35:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:35:40,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:40,514 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:40,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:40,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-12-19 01:35:40,717 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:40,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:40,718 INFO L85 PathProgramCache]: Analyzing trace with hash -959580616, now seen corresponding path program 1 times [2023-12-19 01:35:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:40,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244764148] [2023-12-19 01:35:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:40,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:35:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:35:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:35:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:35:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-19 01:35:40,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244764148] [2023-12-19 01:35:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244764148] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139321613] [2023-12-19 01:35:40,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:40,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:40,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:40,815 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:40,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-19 01:35:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:40,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:35:40,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-19 01:35:41,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139321613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:41,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:41,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:35:41,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727862046] [2023-12-19 01:35:41,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:41,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:35:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:35:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:35:41,009 INFO L87 Difference]: Start difference. First operand 20284 states and 25701 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:42,407 INFO L93 Difference]: Finished difference Result 38577 states and 49410 transitions. [2023-12-19 01:35:42,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:35:42,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-12-19 01:35:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:42,454 INFO L225 Difference]: With dead ends: 38577 [2023-12-19 01:35:42,455 INFO L226 Difference]: Without dead ends: 20284 [2023-12-19 01:35:42,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:35:42,487 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 329 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:42,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 399 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:35:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20284 states. [2023-12-19 01:35:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20284 to 20284. [2023-12-19 01:35:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20284 states, 17112 states have (on average 1.1969378214118747) internal successors, (20482), 17448 states have internal predecessors, (20482), 1561 states have call successors, (1561), 1188 states have call predecessors, (1561), 1609 states have return successors, (3208), 1649 states have call predecessors, (3208), 1558 states have call successors, (3208) [2023-12-19 01:35:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20284 states to 20284 states and 25251 transitions. [2023-12-19 01:35:43,894 INFO L78 Accepts]: Start accepts. Automaton has 20284 states and 25251 transitions. Word has length 152 [2023-12-19 01:35:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:43,894 INFO L495 AbstractCegarLoop]: Abstraction has 20284 states and 25251 transitions. [2023-12-19 01:35:43,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 20284 states and 25251 transitions. [2023-12-19 01:35:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:35:43,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:43,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:43,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:44,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-12-19 01:35:44,108 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:44,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash -488224266, now seen corresponding path program 1 times [2023-12-19 01:35:44,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518227605] [2023-12-19 01:35:44,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:44,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:35:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:35:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:35:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:35:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-19 01:35:44,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:44,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518227605] [2023-12-19 01:35:44,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518227605] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:44,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798000790] [2023-12-19 01:35:44,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:44,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:44,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:44,206 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:44,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-19 01:35:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:44,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 01:35:44,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-19 01:35:44,396 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:44,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798000790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:44,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:44,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-19 01:35:44,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463215589] [2023-12-19 01:35:44,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:44,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:35:44,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:44,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:35:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:35:44,397 INFO L87 Difference]: Start difference. First operand 20284 states and 25251 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:45,762 INFO L93 Difference]: Finished difference Result 30694 states and 38666 transitions. [2023-12-19 01:35:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:35:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-12-19 01:35:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:45,806 INFO L225 Difference]: With dead ends: 30694 [2023-12-19 01:35:45,806 INFO L226 Difference]: Without dead ends: 17826 [2023-12-19 01:35:45,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:35:45,824 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 325 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:45,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 392 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 01:35:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17826 states. [2023-12-19 01:35:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17826 to 13299. [2023-12-19 01:35:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13299 states, 11211 states have (on average 1.1778610293461778) internal successors, (13205), 11412 states have internal predecessors, (13205), 1038 states have call successors, (1038), 779 states have call predecessors, (1038), 1048 states have return successors, (2116), 1108 states have call predecessors, (2116), 1035 states have call successors, (2116) [2023-12-19 01:35:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13299 states to 13299 states and 16359 transitions. [2023-12-19 01:35:46,728 INFO L78 Accepts]: Start accepts. Automaton has 13299 states and 16359 transitions. Word has length 152 [2023-12-19 01:35:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:46,728 INFO L495 AbstractCegarLoop]: Abstraction has 13299 states and 16359 transitions. [2023-12-19 01:35:46,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13299 states and 16359 transitions. [2023-12-19 01:35:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:35:46,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:46,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:46,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:46,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:46,936 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:46,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1238920696, now seen corresponding path program 1 times [2023-12-19 01:35:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371156284] [2023-12-19 01:35:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:35:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:35:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 01:35:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:35:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-19 01:35:47,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:47,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371156284] [2023-12-19 01:35:47,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371156284] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:47,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129640881] [2023-12-19 01:35:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:47,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:47,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:47,081 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:47,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-19 01:35:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:47,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:35:47,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-19 01:35:47,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:47,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129640881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:47,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:47,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:35:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215798740] [2023-12-19 01:35:47,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:47,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:35:47,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:47,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:35:47,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:35:47,214 INFO L87 Difference]: Start difference. First operand 13299 states and 16359 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:47,984 INFO L93 Difference]: Finished difference Result 23025 states and 28823 transitions. [2023-12-19 01:35:47,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:35:47,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-12-19 01:35:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:48,007 INFO L225 Difference]: With dead ends: 23025 [2023-12-19 01:35:48,007 INFO L226 Difference]: Without dead ends: 9834 [2023-12-19 01:35:48,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:35:48,028 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 20 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:48,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 787 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2023-12-19 01:35:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9712. [2023-12-19 01:35:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9712 states, 8108 states have (on average 1.1581154415392205) internal successors, (9390), 8248 states have internal predecessors, (9390), 799 states have call successors, (799), 605 states have call predecessors, (799), 803 states have return successors, (1364), 859 states have call predecessors, (1364), 796 states have call successors, (1364) [2023-12-19 01:35:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9712 states to 9712 states and 11553 transitions. [2023-12-19 01:35:48,767 INFO L78 Accepts]: Start accepts. Automaton has 9712 states and 11553 transitions. Word has length 152 [2023-12-19 01:35:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:48,767 INFO L495 AbstractCegarLoop]: Abstraction has 9712 states and 11553 transitions. [2023-12-19 01:35:48,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 9712 states and 11553 transitions. [2023-12-19 01:35:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:35:48,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:48,771 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:48,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:48,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:48,972 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:48,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1951251100, now seen corresponding path program 1 times [2023-12-19 01:35:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:48,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265419566] [2023-12-19 01:35:48,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:35:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:35:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:35:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:35:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-19 01:35:49,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:49,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265419566] [2023-12-19 01:35:49,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265419566] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:49,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797099403] [2023-12-19 01:35:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:49,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:49,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:49,067 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:49,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-19 01:35:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:49,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:35:49,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-19 01:35:49,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797099403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:49,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:35:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12468751] [2023-12-19 01:35:49,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:49,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:35:49,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:49,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:35:49,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:35:49,191 INFO L87 Difference]: Start difference. First operand 9712 states and 11553 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:49,807 INFO L93 Difference]: Finished difference Result 16572 states and 20079 transitions. [2023-12-19 01:35:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:35:49,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-12-19 01:35:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:49,829 INFO L225 Difference]: With dead ends: 16572 [2023-12-19 01:35:49,829 INFO L226 Difference]: Without dead ends: 8852 [2023-12-19 01:35:49,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:35:49,843 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 11 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:49,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 789 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2023-12-19 01:35:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 8832. [2023-12-19 01:35:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8832 states, 7343 states have (on average 1.1424485904943484) internal successors, (8389), 7465 states have internal predecessors, (8389), 747 states have call successors, (747), 564 states have call predecessors, (747), 740 states have return successors, (1209), 803 states have call predecessors, (1209), 744 states have call successors, (1209) [2023-12-19 01:35:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8832 states to 8832 states and 10345 transitions. [2023-12-19 01:35:50,555 INFO L78 Accepts]: Start accepts. Automaton has 8832 states and 10345 transitions. Word has length 152 [2023-12-19 01:35:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:50,556 INFO L495 AbstractCegarLoop]: Abstraction has 8832 states and 10345 transitions. [2023-12-19 01:35:50,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 8832 states and 10345 transitions. [2023-12-19 01:35:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 01:35:50,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:50,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:50,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-19 01:35:50,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-12-19 01:35:50,760 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:50,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash -387512990, now seen corresponding path program 1 times [2023-12-19 01:35:50,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:50,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824524137] [2023-12-19 01:35:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 01:35:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 01:35:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:35:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-19 01:35:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-19 01:35:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824524137] [2023-12-19 01:35:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824524137] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 01:35:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777172427] [2023-12-19 01:35:50,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:50,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 01:35:50,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:35:50,860 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 01:35:50,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-19 01:35:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:50,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 01:35:50,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 01:35:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-19 01:35:50,982 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 01:35:50,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777172427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:50,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 01:35:50,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-19 01:35:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848486751] [2023-12-19 01:35:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:50,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 01:35:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:50,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 01:35:50,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:35:50,984 INFO L87 Difference]: Start difference. First operand 8832 states and 10345 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:51,465 INFO L93 Difference]: Finished difference Result 11697 states and 13673 transitions. [2023-12-19 01:35:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 01:35:51,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 152 [2023-12-19 01:35:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:51,473 INFO L225 Difference]: With dead ends: 11697 [2023-12-19 01:35:51,473 INFO L226 Difference]: Without dead ends: 3883 [2023-12-19 01:35:51,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:35:51,481 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 2 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:51,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 790 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 01:35:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2023-12-19 01:35:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2023-12-19 01:35:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 3188 states have (on average 1.140840652446675) internal successors, (3637), 3217 states have internal predecessors, (3637), 362 states have call successors, (362), 268 states have call predecessors, (362), 331 states have return successors, (464), 398 states have call predecessors, (464), 359 states have call successors, (464) [2023-12-19 01:35:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 4463 transitions. [2023-12-19 01:35:51,781 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 4463 transitions. Word has length 152 [2023-12-19 01:35:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:51,781 INFO L495 AbstractCegarLoop]: Abstraction has 3883 states and 4463 transitions. [2023-12-19 01:35:51,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-19 01:35:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 4463 transitions. [2023-12-19 01:35:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-19 01:35:51,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:51,783 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:51,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-19 01:35:51,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-12-19 01:35:51,984 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:51,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1425379479, now seen corresponding path program 1 times [2023-12-19 01:35:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:51,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703547108] [2023-12-19 01:35:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:35:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:35:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:35:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-19 01:35:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-19 01:35:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-19 01:35:52,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:52,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703547108] [2023-12-19 01:35:52,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703547108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:52,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:35:52,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 01:35:52,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123170939] [2023-12-19 01:35:52,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:52,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 01:35:52,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:52,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 01:35:52,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 01:35:52,162 INFO L87 Difference]: Start difference. First operand 3883 states and 4463 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-19 01:35:53,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:53,255 INFO L93 Difference]: Finished difference Result 4108 states and 4705 transitions. [2023-12-19 01:35:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:35:53,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 184 [2023-12-19 01:35:53,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:53,262 INFO L225 Difference]: With dead ends: 4108 [2023-12-19 01:35:53,262 INFO L226 Difference]: Without dead ends: 4105 [2023-12-19 01:35:53,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:35:53,263 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 831 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:53,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 914 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 01:35:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2023-12-19 01:35:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 3816. [2023-12-19 01:35:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3816 states, 3132 states have (on average 1.1408045977011494) internal successors, (3573), 3161 states have internal predecessors, (3573), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2023-12-19 01:35:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 3816 states and 4387 transitions. [2023-12-19 01:35:53,568 INFO L78 Accepts]: Start accepts. Automaton has 3816 states and 4387 transitions. Word has length 184 [2023-12-19 01:35:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:53,568 INFO L495 AbstractCegarLoop]: Abstraction has 3816 states and 4387 transitions. [2023-12-19 01:35:53,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-19 01:35:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3816 states and 4387 transitions. [2023-12-19 01:35:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-19 01:35:53,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:53,571 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:53,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-19 01:35:53,571 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:53,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -59143617, now seen corresponding path program 1 times [2023-12-19 01:35:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:53,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918965443] [2023-12-19 01:35:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:35:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:35:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 01:35:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 01:35:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 01:35:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 01:35:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 01:35:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-19 01:35:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-19 01:35:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-19 01:35:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-19 01:35:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:35:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-19 01:35:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:35:53,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918965443] [2023-12-19 01:35:53,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918965443] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:35:53,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:35:53,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 01:35:53,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828795499] [2023-12-19 01:35:53,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:35:53,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 01:35:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:35:53,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 01:35:53,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 01:35:53,653 INFO L87 Difference]: Start difference. First operand 3816 states and 4387 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:35:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:35:54,306 INFO L93 Difference]: Finished difference Result 4756 states and 5423 transitions. [2023-12-19 01:35:54,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 01:35:54,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 188 [2023-12-19 01:35:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:35:54,317 INFO L225 Difference]: With dead ends: 4756 [2023-12-19 01:35:54,317 INFO L226 Difference]: Without dead ends: 3889 [2023-12-19 01:35:54,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:35:54,320 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 223 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 01:35:54,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 496 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 01:35:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2023-12-19 01:35:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3818. [2023-12-19 01:35:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3818 states, 3134 states have (on average 1.1407147415443524) internal successors, (3575), 3163 states have internal predecessors, (3575), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2023-12-19 01:35:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 4389 transitions. [2023-12-19 01:35:54,705 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 4389 transitions. Word has length 188 [2023-12-19 01:35:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:35:54,705 INFO L495 AbstractCegarLoop]: Abstraction has 3818 states and 4389 transitions. [2023-12-19 01:35:54,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 01:35:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 4389 transitions. [2023-12-19 01:35:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-19 01:35:54,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:35:54,708 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:54,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-19 01:35:54,708 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:35:54,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:35:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash -604398580, now seen corresponding path program 1 times [2023-12-19 01:35:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:35:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492155701] [2023-12-19 01:35:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:35:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:35:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:35:54,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 01:35:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:35:54,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 01:35:54,799 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 01:35:54,800 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-19 01:35:54,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-19 01:35:54,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-12-19 01:35:54,805 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 01:35:54,809 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 01:35:54,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:35:54 BoogieIcfgContainer [2023-12-19 01:35:54,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 01:35:54,950 INFO L158 Benchmark]: Toolchain (without parser) took 103488.81ms. Allocated memory was 184.5MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 147.3MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2023-12-19 01:35:54,950 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:35:54,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.16ms. Allocated memory is still 184.5MB. Free memory was 147.0MB in the beginning and 128.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 01:35:54,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.11ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 126.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 01:35:54,950 INFO L158 Benchmark]: Boogie Preprocessor took 88.73ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 122.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 01:35:54,950 INFO L158 Benchmark]: RCFGBuilder took 784.03ms. Allocated memory is still 184.5MB. Free memory was 122.4MB in the beginning and 146.7MB in the end (delta: -24.2MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2023-12-19 01:35:54,951 INFO L158 Benchmark]: TraceAbstraction took 102134.60ms. Allocated memory was 184.5MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 146.1MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2023-12-19 01:35:54,951 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 429.16ms. Allocated memory is still 184.5MB. Free memory was 147.0MB in the beginning and 128.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.11ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 126.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 88.73ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 122.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 784.03ms. Allocated memory is still 184.5MB. Free memory was 122.4MB in the beginning and 146.7MB in the end (delta: -24.2MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. * TraceAbstraction took 102134.60ms. Allocated memory was 184.5MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 146.1MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; [L1099] COND FALSE !(__VERIFIER_nondet_int()) [L1102] CALL main2() [L1086] int __retres1 ; [L1090] CALL init_model2() [L1000] m_i = 1 [L1001] t1_i = 1 [L1002] t2_i = 1 [L1090] RET init_model2() [L1091] CALL start_simulation2() [L1027] int kernel_st ; [L1028] int tmp ; [L1029] int tmp___0 ; [L1033] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1034] FCALL update_channels2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] CALL init_threads2() [L719] COND TRUE m_i == 1 [L720] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L724] COND TRUE t1_i == 1 [L725] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L729] COND TRUE t2_i == 1 [L730] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] RET init_threads2() [L1036] CALL fire_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L837] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L847] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L852] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L857] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1036] RET fire_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1037] CALL activate_threads2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L664] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] return (__retres1); [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L673] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L683] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L685] return (__retres1); [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L692] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L702] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L704] return (__retres1); [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1037] RET activate_threads2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] CALL reset_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L870] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L880] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L885] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L890] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L895] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] RET reset_delta_events2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1041] COND TRUE 1 [L1044] kernel_st = 1 [L1045] CALL eval2() [L765] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L739] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L760] return (__retres1); [L772] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L779-L790] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE, EXPR \read(tmp_ndt_2) [L798] EXPR t1_st = 1 [L799] CALL, EXPR transmit1() [L582] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L593] COND TRUE 1 [L595] t1_pc = 1 [L596] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] RET, EXPR transmit1() [L793-L804] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE, EXPR \read(tmp_ndt_3) [L812] EXPR t2_st = 1 [L813] CALL, EXPR transmit2() [L618] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L629] COND TRUE 1 [L631] t2_pc = 1 [L632] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET, EXPR transmit2() [L807-L818] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L769] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L739] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L760] return (__retres1); [L772] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE, EXPR \read(tmp_ndt_1) [L784] EXPR m_st = 1 [L785] CALL, EXPR master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L537] COND TRUE 1 [L540] token = __VERIFIER_nondet_int() [L541] local = token [L542] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L543] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L943] CALL activate_threads2() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L664] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] return (__retres1); [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L673] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L674] COND TRUE E_1 == 1 [L675] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L685] return (__retres1); [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND TRUE \read(tmp___0) [L922] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L692] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L693] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L702] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] return (__retres1); [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L943] RET activate_threads2() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L543] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L544] E_1 = 2 [L545] m_pc = 1 [L546] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L785] RET, EXPR master() [L779-L790] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE, EXPR \read(tmp_ndt_2) [L798] EXPR t1_st = 1 [L799] CALL, EXPR transmit1() [L582] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=0] [L585] COND TRUE t1_pc == 1 [L601] token += 1 [L602] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L603] CALL immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L943] CALL activate_threads2() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L654] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L655] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L664] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L666] return (__retres1); [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L673] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L674] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L683] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L685] return (__retres1); [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L692] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L693] COND TRUE E_2 == 1 [L694] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L704] return (__retres1); [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND TRUE \read(tmp___1) [L930] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L943] RET activate_threads2() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L603] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L604] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L593] COND TRUE 1 [L595] t1_pc = 1 [L596] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L799] RET, EXPR transmit1() [L793-L804] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, token=1] [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE, EXPR \read(tmp_ndt_3) [L812] EXPR t2_st = 1 [L813] CALL, EXPR transmit2() [L618] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L621] COND TRUE t2_pc == 1 [L637] token += 1 [L638] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] CALL immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L943] CALL activate_threads2() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L654] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L655] COND TRUE E_M == 1 [L656] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L666] return (__retres1); [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND TRUE \read(tmp) [L914] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L673] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L674] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L683] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L685] return (__retres1); [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L692] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L693] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L702] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L704] return (__retres1); [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L943] RET activate_threads2() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L640] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L629] COND TRUE 1 [L631] t2_pc = 1 [L632] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L813] RET, EXPR transmit2() [L807-L818] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L769] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L772] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L739] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L760] return (__retres1); [L772] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L529] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L551] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L556] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L557] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L562] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L563] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L564] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L565] CALL error2() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L496] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 28]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 217 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 101.9s, OverallIterations: 47, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 53.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21086 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20593 mSDsluCounter, 31235 SdHoareTripleChecker+Invalid, 12.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20271 mSDsCounter, 3783 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22156 IncrementalHoareTripleChecker+Invalid, 25939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3783 mSolverCounterUnsat, 10964 mSDtfsCounter, 22156 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4429 GetRequests, 3959 SyntacticMatches, 0 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35196occurred in iteration=33, InterpolantAutomatonStates: 413, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.9s AutomataMinimizationTime, 46 MinimizatonAttempts, 26697 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 8130 NumberOfCodeBlocks, 8130 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 7941 ConstructedInterpolants, 0 QuantifiedInterpolants, 13982 SizeOfPredicates, 4 NumberOfNonLiveVariables, 10767 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 68 InterpolantComputations, 45 PerfectInterpolantSequences, 3489/3955 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! [2023-12-19 01:35:54,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...