./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7f05adfe3188223e40d6d03e9bb9b8e606803720f2852bb7411adc46181c52f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:14:50,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:14:51,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:14:51,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:14:51,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:14:51,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:14:51,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:14:51,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:14:51,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:14:51,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:14:51,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:14:51,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:14:51,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:14:51,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:14:51,090 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:14:51,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:14:51,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:14:51,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:14:51,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:14:51,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:14:51,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:14:51,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:14:51,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:14:51,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:14:51,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:14:51,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:14:51,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:14:51,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:14:51,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:14:51,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:14:51,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:14:51,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:14:51,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:14:51,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:14:51,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:14:51,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:14:51,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:14:51,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:14:51,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:14:51,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:14:51,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:14:51,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:14:51,099 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-clean/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e7f05adfe3188223e40d6d03e9bb9b8e606803720f2852bb7411adc46181c52f [2024-10-11 04:14:51,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:14:51,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:14:51,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:14:51,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:14:51,422 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:14:51,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c [2024-10-11 04:14:52,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:14:53,577 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:14:53,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c [2024-10-11 04:14:53,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1192e15a1/3b44f7581e724df485f144dfea0d1599/FLAG6e6f2c5fe [2024-10-11 04:14:53,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1192e15a1/3b44f7581e724df485f144dfea0d1599 [2024-10-11 04:14:53,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:14:53,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:14:53,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:14:53,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:14:53,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:14:53,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:14:53" (1/1) ... [2024-10-11 04:14:53,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275e807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:53, skipping insertion in model container [2024-10-11 04:14:53,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:14:53" (1/1) ... [2024-10-11 04:14:54,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:14:55,741 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c[378560,378573] [2024-10-11 04:14:55,769 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c[383339,383352] [2024-10-11 04:14:56,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:14:56,084 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:14:56,891 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c[378560,378573] [2024-10-11 04:14:56,902 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c[383339,383352] [2024-10-11 04:14:56,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:14:57,012 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:14:57,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57 WrapperNode [2024-10-11 04:14:57,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:14:57,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:14:57,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:14:57,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:14:57,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:57,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:57,497 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13239 [2024-10-11 04:14:57,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:14:57,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:14:57,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:14:57,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:14:57,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:57,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:57,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:57,791 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]. [2024-10-11 04:14:57,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:57,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:57,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:58,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:58,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:58,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:58,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:14:58,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:14:58,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:14:58,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:14:58,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (1/1) ... [2024-10-11 04:14:58,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:14:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:14:58,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:14:58,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:14:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:14:58,462 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:14:58,462 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:14:58,462 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:14:58,464 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:14:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:14:58,467 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:14:58,467 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:14:58,468 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:14:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:14:58,468 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:14:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:14:58,469 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:14:58,469 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:14:58,470 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:14:58,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:14:58,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:14:58,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:14:58,674 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:14:58,676 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:15:06,835 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2024-10-11 04:15:06,835 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:15:06,966 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:15:06,967 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-11 04:15:06,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:15:06 BoogieIcfgContainer [2024-10-11 04:15:06,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:15:06,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:15:06,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:15:06,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:15:06,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:14:53" (1/3) ... [2024-10-11 04:15:06,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1b14d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:15:06, skipping insertion in model container [2024-10-11 04:15:06,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:57" (2/3) ... [2024-10-11 04:15:06,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1b14d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:15:06, skipping insertion in model container [2024-10-11 04:15:06,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:15:06" (3/3) ... [2024-10-11 04:15:06,978 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.12.cil-1.c [2024-10-11 04:15:06,995 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:15:06,995 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:15:07,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:15:07,153 INFO L333 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, 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;@44aa816b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:15:07,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:15:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 2479 states, 2441 states have (on average 1.8758705448586646) internal successors, (4579), 2446 states have internal predecessors, (4579), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 04:15:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:07,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:07,191 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:07,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:07,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash 446400829, now seen corresponding path program 1 times [2024-10-11 04:15:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:07,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566144930] [2024-10-11 04:15:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:07,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:07,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566144930] [2024-10-11 04:15:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566144930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:07,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:07,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:15:07,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446708328] [2024-10-11 04:15:07,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:07,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:15:07,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:08,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:15:08,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:15:08,031 INFO L87 Difference]: Start difference. First operand has 2479 states, 2441 states have (on average 1.8758705448586646) internal successors, (4579), 2446 states have internal predecessors, (4579), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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) [2024-10-11 04:15:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:10,304 INFO L93 Difference]: Finished difference Result 5083 states and 9494 transitions. [2024-10-11 04:15:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:15:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:10,345 INFO L225 Difference]: With dead ends: 5083 [2024-10-11 04:15:10,345 INFO L226 Difference]: Without dead ends: 2604 [2024-10-11 04:15:10,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:15:10,362 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 993 mSDsluCounter, 12222 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 16490 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:10,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 16490 Invalid, 1131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:15:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2024-10-11 04:15:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2474. [2024-10-11 04:15:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2438 states have (on average 1.8371616078753077) internal successors, (4479), 2441 states have internal predecessors, (4479), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:15:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 4533 transitions. [2024-10-11 04:15:10,546 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 4533 transitions. Word has length 162 [2024-10-11 04:15:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:10,547 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 4533 transitions. [2024-10-11 04:15:10,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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) [2024-10-11 04:15:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 4533 transitions. [2024-10-11 04:15:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:10,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:10,553 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:10,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:15:10,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:10,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2079094853, now seen corresponding path program 1 times [2024-10-11 04:15:10,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:10,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495378662] [2024-10-11 04:15:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:10,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:10,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:10,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495378662] [2024-10-11 04:15:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495378662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:10,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:15:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739240504] [2024-10-11 04:15:10,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:10,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:15:10,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:15:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:15:10,911 INFO L87 Difference]: Start difference. First operand 2474 states and 4533 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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) [2024-10-11 04:15:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:13,052 INFO L93 Difference]: Finished difference Result 2944 states and 5318 transitions. [2024-10-11 04:15:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:15:13,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:13,068 INFO L225 Difference]: With dead ends: 2944 [2024-10-11 04:15:13,069 INFO L226 Difference]: Without dead ends: 2604 [2024-10-11 04:15:13,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:15:13,072 INFO L432 NwaCegarLoop]: 4264 mSDtfsCounter, 981 mSDsluCounter, 12213 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 16477 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:13,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 16477 Invalid, 1120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:15:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2024-10-11 04:15:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2474. [2024-10-11 04:15:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2438 states have (on average 1.8367514356029533) internal successors, (4478), 2441 states have internal predecessors, (4478), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:15:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 4532 transitions. [2024-10-11 04:15:13,159 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 4532 transitions. Word has length 162 [2024-10-11 04:15:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:13,160 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 4532 transitions. [2024-10-11 04:15:13,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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) [2024-10-11 04:15:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 4532 transitions. [2024-10-11 04:15:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:13,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:13,164 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:13,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:15:13,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:13,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 284746809, now seen corresponding path program 1 times [2024-10-11 04:15:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41027894] [2024-10-11 04:15:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:13,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:13,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:13,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:13,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41027894] [2024-10-11 04:15:13,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41027894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:13,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:15:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678105321] [2024-10-11 04:15:13,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:13,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:15:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:13,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:15:13,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:15:13,546 INFO L87 Difference]: Start difference. First operand 2474 states and 4532 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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) [2024-10-11 04:15:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:16,885 INFO L93 Difference]: Finished difference Result 3423 states and 6122 transitions. [2024-10-11 04:15:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:15:16,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:16,904 INFO L225 Difference]: With dead ends: 3423 [2024-10-11 04:15:16,904 INFO L226 Difference]: Without dead ends: 3088 [2024-10-11 04:15:16,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:15:16,909 INFO L432 NwaCegarLoop]: 4283 mSDtfsCounter, 5449 mSDsluCounter, 12796 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5468 SdHoareTripleChecker+Valid, 17079 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:16,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5468 Valid, 17079 Invalid, 2468 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [116 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:15:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2024-10-11 04:15:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2827. [2024-10-11 04:15:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2763 states have (on average 1.8154180238870792) internal successors, (5016), 2767 states have internal predecessors, (5016), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-11 04:15:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 5115 transitions. [2024-10-11 04:15:17,015 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 5115 transitions. Word has length 162 [2024-10-11 04:15:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:17,016 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 5115 transitions. [2024-10-11 04:15:17,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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) [2024-10-11 04:15:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 5115 transitions. [2024-10-11 04:15:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:17,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:17,020 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:17,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:15:17,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:17,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1920621575, now seen corresponding path program 1 times [2024-10-11 04:15:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772792872] [2024-10-11 04:15:17,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:17,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:17,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772792872] [2024-10-11 04:15:17,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772792872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:17,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:17,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:17,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25881888] [2024-10-11 04:15:17,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:17,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:17,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:17,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:17,383 INFO L87 Difference]: Start difference. First operand 2827 states and 5115 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:21,403 INFO L93 Difference]: Finished difference Result 4278 states and 7548 transitions. [2024-10-11 04:15:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:21,422 INFO L225 Difference]: With dead ends: 4278 [2024-10-11 04:15:21,422 INFO L226 Difference]: Without dead ends: 3590 [2024-10-11 04:15:21,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:15:21,431 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5484 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5503 SdHoareTripleChecker+Valid, 21882 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:21,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5503 Valid, 21882 Invalid, 3805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 04:15:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2024-10-11 04:15:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3153. [2024-10-11 04:15:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3153 states, 3061 states have (on average 1.796798431885005) internal successors, (5500), 3066 states have internal predecessors, (5500), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 04:15:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 5643 transitions. [2024-10-11 04:15:21,547 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 5643 transitions. Word has length 162 [2024-10-11 04:15:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:21,547 INFO L471 AbstractCegarLoop]: Abstraction has 3153 states and 5643 transitions. [2024-10-11 04:15:21,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 5643 transitions. [2024-10-11 04:15:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:21,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:21,550 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:21,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:15:21,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:21,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1510011209, now seen corresponding path program 1 times [2024-10-11 04:15:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895871269] [2024-10-11 04:15:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:21,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895871269] [2024-10-11 04:15:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895871269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:21,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:21,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:21,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513515828] [2024-10-11 04:15:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:21,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:21,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:21,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:21,891 INFO L87 Difference]: Start difference. First operand 3153 states and 5643 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:25,203 INFO L93 Difference]: Finished difference Result 5531 states and 9624 transitions. [2024-10-11 04:15:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:25,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:25,224 INFO L225 Difference]: With dead ends: 5531 [2024-10-11 04:15:25,225 INFO L226 Difference]: Without dead ends: 4517 [2024-10-11 04:15:25,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:15:25,231 INFO L432 NwaCegarLoop]: 4241 mSDtfsCounter, 5596 mSDsluCounter, 16898 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5615 SdHoareTripleChecker+Valid, 21139 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:25,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5615 Valid, 21139 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:15:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2024-10-11 04:15:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 3806. [2024-10-11 04:15:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3658 states have (on average 1.7684527063969382) internal successors, (6469), 3665 states have internal predecessors, (6469), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:15:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6704 transitions. [2024-10-11 04:15:25,387 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6704 transitions. Word has length 162 [2024-10-11 04:15:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:25,388 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6704 transitions. [2024-10-11 04:15:25,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6704 transitions. [2024-10-11 04:15:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:25,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:25,391 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:25,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:15:25,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:25,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash 997086265, now seen corresponding path program 1 times [2024-10-11 04:15:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:25,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956486570] [2024-10-11 04:15:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:25,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:25,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:25,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:25,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:25,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956486570] [2024-10-11 04:15:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956486570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:25,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:25,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928380815] [2024-10-11 04:15:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:25,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:25,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:25,686 INFO L87 Difference]: Start difference. First operand 3806 states and 6704 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:27,743 INFO L93 Difference]: Finished difference Result 6172 states and 10676 transitions. [2024-10-11 04:15:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:15:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:27,765 INFO L225 Difference]: With dead ends: 6172 [2024-10-11 04:15:27,766 INFO L226 Difference]: Without dead ends: 4505 [2024-10-11 04:15:27,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:15:27,774 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5053 mSDsluCounter, 16637 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5073 SdHoareTripleChecker+Valid, 20856 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:27,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5073 Valid, 20856 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:15:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2024-10-11 04:15:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3806. [2024-10-11 04:15:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3658 states have (on average 1.7670858392564244) internal successors, (6464), 3665 states have internal predecessors, (6464), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:15:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6699 transitions. [2024-10-11 04:15:28,073 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6699 transitions. Word has length 162 [2024-10-11 04:15:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:28,073 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6699 transitions. [2024-10-11 04:15:28,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6699 transitions. [2024-10-11 04:15:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:28,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:28,079 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:28,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:15:28,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1138796937, now seen corresponding path program 1 times [2024-10-11 04:15:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966123022] [2024-10-11 04:15:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:28,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:28,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:28,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:28,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:28,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966123022] [2024-10-11 04:15:28,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966123022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:28,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:28,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:28,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900949415] [2024-10-11 04:15:28,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:28,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:28,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:28,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:28,440 INFO L87 Difference]: Start difference. First operand 3806 states and 6699 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:30,290 INFO L93 Difference]: Finished difference Result 6161 states and 10640 transitions. [2024-10-11 04:15:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:15:30,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:30,318 INFO L225 Difference]: With dead ends: 6161 [2024-10-11 04:15:30,318 INFO L226 Difference]: Without dead ends: 4494 [2024-10-11 04:15:30,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:15:30,329 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5203 mSDsluCounter, 12509 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 16728 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:30,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 16728 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:15:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2024-10-11 04:15:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 3806. [2024-10-11 04:15:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3658 states have (on average 1.7657189721159103) internal successors, (6459), 3665 states have internal predecessors, (6459), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:15:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6694 transitions. [2024-10-11 04:15:30,564 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6694 transitions. Word has length 162 [2024-10-11 04:15:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:30,565 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6694 transitions. [2024-10-11 04:15:30,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6694 transitions. [2024-10-11 04:15:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:30,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:30,570 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:30,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:15:30,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:30,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:30,571 INFO L85 PathProgramCache]: Analyzing trace with hash -720908235, now seen corresponding path program 1 times [2024-10-11 04:15:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:30,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41158828] [2024-10-11 04:15:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:30,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:30,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:30,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41158828] [2024-10-11 04:15:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41158828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:30,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:30,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811525005] [2024-10-11 04:15:30,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:30,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:30,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:30,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:30,930 INFO L87 Difference]: Start difference. First operand 3806 states and 6694 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:34,702 INFO L93 Difference]: Finished difference Result 7915 states and 13503 transitions. [2024-10-11 04:15:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:34,728 INFO L225 Difference]: With dead ends: 7915 [2024-10-11 04:15:34,728 INFO L226 Difference]: Without dead ends: 6248 [2024-10-11 04:15:34,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:15:34,738 INFO L432 NwaCegarLoop]: 4439 mSDtfsCounter, 5467 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5486 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:34,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5486 Valid, 21880 Invalid, 3728 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:15:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6248 states. [2024-10-11 04:15:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6248 to 5127. [2024-10-11 04:15:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 4867 states have (on average 1.7279638380932814) internal successors, (8410), 4878 states have internal predecessors, (8410), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 04:15:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 8835 transitions. [2024-10-11 04:15:34,981 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 8835 transitions. Word has length 162 [2024-10-11 04:15:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:34,981 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 8835 transitions. [2024-10-11 04:15:34,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 8835 transitions. [2024-10-11 04:15:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:34,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:34,987 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:34,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:15:34,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:34,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash 678045367, now seen corresponding path program 1 times [2024-10-11 04:15:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:34,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416947147] [2024-10-11 04:15:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:34,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:35,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:35,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:35,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:35,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:35,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:35,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416947147] [2024-10-11 04:15:35,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416947147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:35,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:35,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:35,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010274216] [2024-10-11 04:15:35,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:35,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:35,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:35,246 INFO L87 Difference]: Start difference. First operand 5127 states and 8835 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:37,150 INFO L93 Difference]: Finished difference Result 9259 states and 15717 transitions. [2024-10-11 04:15:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:15:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:37,170 INFO L225 Difference]: With dead ends: 9259 [2024-10-11 04:15:37,170 INFO L226 Difference]: Without dead ends: 6271 [2024-10-11 04:15:37,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:15:37,180 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5202 mSDsluCounter, 12509 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 16728 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:37,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 16728 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:15:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2024-10-11 04:15:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 5127. [2024-10-11 04:15:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 4867 states have (on average 1.7261146496815287) internal successors, (8401), 4878 states have internal predecessors, (8401), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 04:15:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 8826 transitions. [2024-10-11 04:15:37,401 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 8826 transitions. Word has length 162 [2024-10-11 04:15:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:37,402 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 8826 transitions. [2024-10-11 04:15:37,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 8826 transitions. [2024-10-11 04:15:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:37,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:37,406 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:37,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:15:37,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:37,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash -939395083, now seen corresponding path program 1 times [2024-10-11 04:15:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:37,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633496123] [2024-10-11 04:15:37,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:37,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:37,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:37,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:37,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633496123] [2024-10-11 04:15:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633496123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:37,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:37,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913655908] [2024-10-11 04:15:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:37,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:37,677 INFO L87 Difference]: Start difference. First operand 5127 states and 8826 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:41,269 INFO L93 Difference]: Finished difference Result 12710 states and 21332 transitions. [2024-10-11 04:15:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:41,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:41,303 INFO L225 Difference]: With dead ends: 12710 [2024-10-11 04:15:41,303 INFO L226 Difference]: Without dead ends: 9722 [2024-10-11 04:15:41,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:15:41,318 INFO L432 NwaCegarLoop]: 4439 mSDtfsCounter, 5459 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5478 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 3690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:41,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5478 Valid, 21880 Invalid, 3690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:15:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9722 states. [2024-10-11 04:15:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9722 to 7779. [2024-10-11 04:15:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7779 states, 7295 states have (on average 1.6864976010966415) internal successors, (12303), 7314 states have internal predecessors, (12303), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-11 04:15:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 13126 transitions. [2024-10-11 04:15:41,830 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 13126 transitions. Word has length 162 [2024-10-11 04:15:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:41,831 INFO L471 AbstractCegarLoop]: Abstraction has 7779 states and 13126 transitions. [2024-10-11 04:15:41,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 13126 transitions. [2024-10-11 04:15:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:41,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:41,837 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:41,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:15:41,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash -575928585, now seen corresponding path program 1 times [2024-10-11 04:15:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:41,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205473133] [2024-10-11 04:15:41,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:42,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:42,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:42,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:42,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:42,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205473133] [2024-10-11 04:15:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205473133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:42,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:42,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551767299] [2024-10-11 04:15:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:42,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:42,096 INFO L87 Difference]: Start difference. First operand 7779 states and 13126 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:46,467 INFO L93 Difference]: Finished difference Result 22316 states and 37122 transitions. [2024-10-11 04:15:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:46,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:46,531 INFO L225 Difference]: With dead ends: 22316 [2024-10-11 04:15:46,531 INFO L226 Difference]: Without dead ends: 16676 [2024-10-11 04:15:46,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:15:46,556 INFO L432 NwaCegarLoop]: 4439 mSDtfsCounter, 5458 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5477 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:46,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5477 Valid, 21880 Invalid, 3677 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3610 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:15:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16676 states. [2024-10-11 04:15:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16676 to 13096. [2024-10-11 04:15:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13096 states, 12164 states have (on average 1.6544722130878) internal successors, (20125), 12199 states have internal predecessors, (20125), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-11 04:15:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13096 states to 13096 states and 21798 transitions. [2024-10-11 04:15:47,286 INFO L78 Accepts]: Start accepts. Automaton has 13096 states and 21798 transitions. Word has length 162 [2024-10-11 04:15:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:47,286 INFO L471 AbstractCegarLoop]: Abstraction has 13096 states and 21798 transitions. [2024-10-11 04:15:47,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13096 states and 21798 transitions. [2024-10-11 04:15:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:47,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:47,295 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:47,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:15:47,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:47,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash -287109195, now seen corresponding path program 1 times [2024-10-11 04:15:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387065217] [2024-10-11 04:15:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:47,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387065217] [2024-10-11 04:15:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387065217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:47,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559793128] [2024-10-11 04:15:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:47,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:47,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:47,555 INFO L87 Difference]: Start difference. First operand 13096 states and 21798 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:51,788 INFO L93 Difference]: Finished difference Result 41527 states and 68892 transitions. [2024-10-11 04:15:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:51,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:51,913 INFO L225 Difference]: With dead ends: 41527 [2024-10-11 04:15:51,913 INFO L226 Difference]: Without dead ends: 30570 [2024-10-11 04:15:51,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:15:51,967 INFO L432 NwaCegarLoop]: 4241 mSDtfsCounter, 5557 mSDsluCounter, 16898 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5576 SdHoareTripleChecker+Valid, 21139 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:51,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5576 Valid, 21139 Invalid, 3112 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [107 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:15:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30570 states. [2024-10-11 04:15:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30570 to 23761. [2024-10-11 04:15:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23761 states, 21933 states have (on average 1.6329275520904574) internal successors, (35815), 22000 states have internal predecessors, (35815), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 04:15:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23761 states to 23761 states and 39350 transitions. [2024-10-11 04:15:53,477 INFO L78 Accepts]: Start accepts. Automaton has 23761 states and 39350 transitions. Word has length 162 [2024-10-11 04:15:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:53,480 INFO L471 AbstractCegarLoop]: Abstraction has 23761 states and 39350 transitions. [2024-10-11 04:15:53,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 23761 states and 39350 transitions. [2024-10-11 04:15:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:53,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:53,498 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:53,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:15:53,498 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:53,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash -831981769, now seen corresponding path program 1 times [2024-10-11 04:15:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:53,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029189715] [2024-10-11 04:15:53,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:53,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:53,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:53,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:53,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:53,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:53,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029189715] [2024-10-11 04:15:53,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029189715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:53,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:53,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:53,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004130417] [2024-10-11 04:15:53,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:53,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:53,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:53,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:53,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:53,741 INFO L87 Difference]: Start difference. First operand 23761 states and 39350 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:56,997 INFO L93 Difference]: Finished difference Result 52623 states and 87952 transitions. [2024-10-11 04:15:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:15:56,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-11 04:15:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:57,130 INFO L225 Difference]: With dead ends: 52623 [2024-10-11 04:15:57,130 INFO L226 Difference]: Without dead ends: 31001 [2024-10-11 04:15:57,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:15:57,200 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5055 mSDsluCounter, 16637 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5075 SdHoareTripleChecker+Valid, 20856 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:57,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5075 Valid, 20856 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:15:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31001 states. [2024-10-11 04:15:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31001 to 23761. [2024-10-11 04:15:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23761 states, 21933 states have (on average 1.62996398121552) internal successors, (35750), 22000 states have internal predecessors, (35750), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 04:15:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23761 states to 23761 states and 39285 transitions. [2024-10-11 04:15:58,780 INFO L78 Accepts]: Start accepts. Automaton has 23761 states and 39285 transitions. Word has length 162 [2024-10-11 04:15:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:58,780 INFO L471 AbstractCegarLoop]: Abstraction has 23761 states and 39285 transitions. [2024-10-11 04:15:58,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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) [2024-10-11 04:15:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 23761 states and 39285 transitions. [2024-10-11 04:15:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:15:58,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:58,796 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:15:58,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:15:58,797 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:58,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -156821643, now seen corresponding path program 1 times [2024-10-11 04:15:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:58,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710436254] [2024-10-11 04:15:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:58,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:58,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:15:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:15:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:59,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:15:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:15:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:59,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:59,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710436254] [2024-10-11 04:15:59,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710436254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:59,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:59,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:59,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649208058] [2024-10-11 04:15:59,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:59,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:59,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:59,059 INFO L87 Difference]: Start difference. First operand 23761 states and 39285 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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)