./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_label46+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_label46+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 8f86f2fbff11a0ee7c52360384354edd19538e6bc949aea04301001498242d90 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:23:20,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:23:20,224 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:23:20,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:23:20,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:23:20,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:23:20,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:23:20,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:23:20,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:23:20,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:23:20,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:23:20,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:23:20,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:23:20,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:23:20,281 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:23:20,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:23:20,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:23:20,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:23:20,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:23:20,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:23:20,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:23:20,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:23:20,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:23:20,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:23:20,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:23:20,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:23:20,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:23:20,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:23:20,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:23:20,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:23:20,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:23:20,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:23:20,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:23:20,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:23:20,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:23:20,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:23:20,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:23:20,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:23:20,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:23:20,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:23:20,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:23:20,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:23:20,291 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 -> 8f86f2fbff11a0ee7c52360384354edd19538e6bc949aea04301001498242d90 [2024-10-11 04:23:20,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:23:20,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:23:20,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:23:20,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:23:20,572 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:23:20,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.12.cil-1.c [2024-10-11 04:23:22,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:23:22,664 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:23:22,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.12.cil-1.c [2024-10-11 04:23:22,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa1b9ed2f/b6f3a26042e84330a43dc9a37969343f/FLAG73282b46d [2024-10-11 04:23:23,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa1b9ed2f/b6f3a26042e84330a43dc9a37969343f [2024-10-11 04:23:23,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:23:23,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:23:23,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:23:23,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:23:23,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:23:23,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:23:23" (1/1) ... [2024-10-11 04:23:23,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2dc4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:23, skipping insertion in model container [2024-10-11 04:23:23,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:23:23" (1/1) ... [2024-10-11 04:23:23,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:23:25,166 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_label46+token_ring.12.cil-1.c[382357,382370] [2024-10-11 04:23:25,199 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_label46+token_ring.12.cil-1.c[383339,383352] [2024-10-11 04:23:25,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:23:25,563 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:23:26,409 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_label46+token_ring.12.cil-1.c[382357,382370] [2024-10-11 04:23:26,412 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_label46+token_ring.12.cil-1.c[383339,383352] [2024-10-11 04:23:26,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:23:26,490 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:23:26,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26 WrapperNode [2024-10-11 04:23:26,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:23:26,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:23:26,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:23:26,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:23:26,500 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:23:26" (1/1) ... [2024-10-11 04:23:26,582 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:23:26" (1/1) ... [2024-10-11 04:23:26,949 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13239 [2024-10-11 04:23:26,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:23:26,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:23:26,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:23:26,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:23:26,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:26,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:27,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:27,267 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:23:27,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:27,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:27,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:27,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:27,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:27,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:27,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:23:27,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:23:27,707 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:23:27,707 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:23:27,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (1/1) ... [2024-10-11 04:23:27,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:23:27,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:23:27,785 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:23:27,804 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:23:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:23:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:23:27,903 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:23:27,904 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:23:27,904 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:23:27,904 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:23:27,904 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:23:27,904 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:23:27,905 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:23:27,905 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:23:27,905 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:23:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:23:27,908 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:23:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:23:27,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:23:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:23:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:23:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:23:28,114 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:23:28,120 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:23:36,336 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2024-10-11 04:23:36,336 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:23:36,458 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:23:36,459 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-11 04:23:36,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:23:36 BoogieIcfgContainer [2024-10-11 04:23:36,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:23:36,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:23:36,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:23:36,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:23:36,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:23:23" (1/3) ... [2024-10-11 04:23:36,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e90add6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:23:36, skipping insertion in model container [2024-10-11 04:23:36,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:26" (2/3) ... [2024-10-11 04:23:36,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e90add6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:23:36, skipping insertion in model container [2024-10-11 04:23:36,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:23:36" (3/3) ... [2024-10-11 04:23:36,471 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.12.cil-1.c [2024-10-11 04:23:36,487 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:23:36,487 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:23:36,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:23:36,616 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;@6dc96ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:23:36,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:23:36,633 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:23:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:23:36,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:36,657 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:23:36,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:36,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash 255000413, now seen corresponding path program 1 times [2024-10-11 04:23:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186500378] [2024-10-11 04:23:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:37,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:37,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:23:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:23:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:37,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:23:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:37,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:23:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:37,377 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:23:37,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186500378] [2024-10-11 04:23:37,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186500378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:37,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:37,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:23:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457641589] [2024-10-11 04:23:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:23:37,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:23:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:23:37,430 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:23:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:39,683 INFO L93 Difference]: Finished difference Result 5083 states and 9494 transitions. [2024-10-11 04:23:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:23:39,686 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:23:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:39,720 INFO L225 Difference]: With dead ends: 5083 [2024-10-11 04:23:39,720 INFO L226 Difference]: Without dead ends: 2604 [2024-10-11 04:23:39,734 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:23:39,739 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:23:39,741 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:23:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2024-10-11 04:23:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2474. [2024-10-11 04:23:39,889 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:23:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 4533 transitions. [2024-10-11 04:23:39,907 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 4533 transitions. Word has length 162 [2024-10-11 04:23:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:39,907 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 4533 transitions. [2024-10-11 04:23:39,908 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:23:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 4533 transitions. [2024-10-11 04:23:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:23:39,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:39,914 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:23:39,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:23:39,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:39,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:39,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2024472027, now seen corresponding path program 1 times [2024-10-11 04:23:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:39,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190909452] [2024-10-11 04:23:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:23:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:40,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:23:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:40,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:23:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:40,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:23:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:40,227 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:23:40,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:40,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190909452] [2024-10-11 04:23:40,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190909452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:40,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:23:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295915124] [2024-10-11 04:23:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:40,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:23:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:23:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:23:40,235 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:23:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:42,209 INFO L93 Difference]: Finished difference Result 2944 states and 5318 transitions. [2024-10-11 04:23:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:23:42,211 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:23:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:42,228 INFO L225 Difference]: With dead ends: 2944 [2024-10-11 04:23:42,229 INFO L226 Difference]: Without dead ends: 2604 [2024-10-11 04:23:42,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:23:42,234 INFO L432 NwaCegarLoop]: 4264 mSDtfsCounter, 981 mSDsluCounter, 12213 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:42,234 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.5s Time] [2024-10-11 04:23:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2024-10-11 04:23:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2474. [2024-10-11 04:23:42,321 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:23:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 4532 transitions. [2024-10-11 04:23:42,334 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 4532 transitions. Word has length 162 [2024-10-11 04:23:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:42,336 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 4532 transitions. [2024-10-11 04:23:42,336 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:23:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 4532 transitions. [2024-10-11 04:23:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:23:42,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:42,342 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:23:42,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:23:42,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:42,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 93346393, now seen corresponding path program 1 times [2024-10-11 04:23:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702574622] [2024-10-11 04:23:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:42,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:23:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:23:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:23:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:23:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:42,816 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:23:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702574622] [2024-10-11 04:23:42,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702574622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:42,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:42,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:23:42,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560732393] [2024-10-11 04:23:42,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:42,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:23:42,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:42,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:23:42,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:23:42,819 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:23:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:45,981 INFO L93 Difference]: Finished difference Result 3423 states and 6122 transitions. [2024-10-11 04:23:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:23:45,982 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:23:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:46,000 INFO L225 Difference]: With dead ends: 3423 [2024-10-11 04:23:46,001 INFO L226 Difference]: Without dead ends: 3088 [2024-10-11 04:23:46,004 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:23:46,006 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:23:46,006 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:23:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2024-10-11 04:23:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2827. [2024-10-11 04:23:46,144 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:23:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 5115 transitions. [2024-10-11 04:23:46,158 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 5115 transitions. Word has length 162 [2024-10-11 04:23:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:46,158 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 5115 transitions. [2024-10-11 04:23:46,159 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:23:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 5115 transitions. [2024-10-11 04:23:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:23:46,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:46,162 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:23:46,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:23:46,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2112021991, now seen corresponding path program 1 times [2024-10-11 04:23:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850650081] [2024-10-11 04:23:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:46,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:23:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:23:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:23:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:46,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:23:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:46,696 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:23:46,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:46,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850650081] [2024-10-11 04:23:46,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850650081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:46,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:46,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:46,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901289300] [2024-10-11 04:23:46,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:46,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:46,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:46,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:46,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:46,699 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:23:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:50,595 INFO L93 Difference]: Finished difference Result 4278 states and 7548 transitions. [2024-10-11 04:23:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:50,596 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:23:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:50,610 INFO L225 Difference]: With dead ends: 4278 [2024-10-11 04:23:50,610 INFO L226 Difference]: Without dead ends: 3590 [2024-10-11 04:23:50,613 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:23:50,614 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:23:50,615 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:23:50,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2024-10-11 04:23:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3153. [2024-10-11 04:23:50,726 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:23:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 5643 transitions. [2024-10-11 04:23:50,737 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 5643 transitions. Word has length 162 [2024-10-11 04:23:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:50,738 INFO L471 AbstractCegarLoop]: Abstraction has 3153 states and 5643 transitions. [2024-10-11 04:23:50,738 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:23:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 5643 transitions. [2024-10-11 04:23:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:23:50,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:50,742 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:23:50,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:23:50,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:50,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1701411625, now seen corresponding path program 1 times [2024-10-11 04:23:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427497712] [2024-10-11 04:23:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:50,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:50,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:23:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:51,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:23:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:23:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:51,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:23:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:51,093 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:23:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427497712] [2024-10-11 04:23:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427497712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:51,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:51,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696482254] [2024-10-11 04:23:51,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:51,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:51,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:51,100 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:23:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:54,364 INFO L93 Difference]: Finished difference Result 5531 states and 9624 transitions. [2024-10-11 04:23:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:54,365 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:23:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:54,385 INFO L225 Difference]: With dead ends: 5531 [2024-10-11 04:23:54,385 INFO L226 Difference]: Without dead ends: 4517 [2024-10-11 04:23:54,390 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:23:54,391 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:23:54,391 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:23:54,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2024-10-11 04:23:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 3806. [2024-10-11 04:23:54,559 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:23:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6704 transitions. [2024-10-11 04:23:54,571 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6704 transitions. Word has length 162 [2024-10-11 04:23:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:54,572 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6704 transitions. [2024-10-11 04:23:54,572 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:23:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6704 transitions. [2024-10-11 04:23:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:23:54,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:54,575 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:23:54,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:23:54,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:54,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash 805685849, now seen corresponding path program 1 times [2024-10-11 04:23:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:54,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901736105] [2024-10-11 04:23:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:54,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:54,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:23:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:54,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:23:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:23:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:54,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:23:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:54,974 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:23:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901736105] [2024-10-11 04:23:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901736105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043273779] [2024-10-11 04:23:54,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:54,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:54,978 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:23:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:56,986 INFO L93 Difference]: Finished difference Result 6172 states and 10676 transitions. [2024-10-11 04:23:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:56,987 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:23:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:57,007 INFO L225 Difference]: With dead ends: 6172 [2024-10-11 04:23:57,007 INFO L226 Difference]: Without dead ends: 4505 [2024-10-11 04:23:57,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:23:57,015 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5053 mSDsluCounter, 16637 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:57,015 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.5s Time] [2024-10-11 04:23:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2024-10-11 04:23:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3806. [2024-10-11 04:23:57,155 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:23:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6699 transitions. [2024-10-11 04:23:57,165 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6699 transitions. Word has length 162 [2024-10-11 04:23:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:57,165 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6699 transitions. [2024-10-11 04:23:57,165 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:23:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6699 transitions. [2024-10-11 04:23:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:23:57,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:57,168 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:23:57,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:23:57,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:57,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:57,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1330197353, now seen corresponding path program 1 times [2024-10-11 04:23:57,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:57,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650168241] [2024-10-11 04:23:57,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:57,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:57,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:23:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:23:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:23:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:57,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:23:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:57,476 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:23:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:57,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650168241] [2024-10-11 04:23:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650168241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:57,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:57,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:57,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196156009] [2024-10-11 04:23:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:57,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:57,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:57,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:57,480 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:23:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:59,340 INFO L93 Difference]: Finished difference Result 6161 states and 10640 transitions. [2024-10-11 04:23:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:59,341 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:23:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:59,362 INFO L225 Difference]: With dead ends: 6161 [2024-10-11 04:23:59,363 INFO L226 Difference]: Without dead ends: 4494 [2024-10-11 04:23:59,370 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:23:59,371 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5203 mSDsluCounter, 12509 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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:23:59,371 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:23:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2024-10-11 04:23:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 3806. [2024-10-11 04:23:59,587 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:23:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6694 transitions. [2024-10-11 04:23:59,603 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6694 transitions. Word has length 162 [2024-10-11 04:23:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:59,604 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6694 transitions. [2024-10-11 04:23:59,604 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:23:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6694 transitions. [2024-10-11 04:23:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:23:59,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:59,608 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:23:59,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:23:59,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:59,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash -912308651, now seen corresponding path program 1 times [2024-10-11 04:23:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595931824] [2024-10-11 04:23:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:59,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:23:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:23:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:59,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:23:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:59,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:23:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:59,937 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:23:59,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:59,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595931824] [2024-10-11 04:23:59,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595931824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:59,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:59,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990632887] [2024-10-11 04:23:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:59,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:59,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:59,940 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:24:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:03,729 INFO L93 Difference]: Finished difference Result 7915 states and 13503 transitions. [2024-10-11 04:24:03,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:03,730 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:24:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:03,752 INFO L225 Difference]: With dead ends: 7915 [2024-10-11 04:24:03,752 INFO L226 Difference]: Without dead ends: 6248 [2024-10-11 04:24:03,758 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:24:03,759 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:03,760 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.6s Time] [2024-10-11 04:24:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6248 states. [2024-10-11 04:24:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6248 to 5127. [2024-10-11 04:24:03,955 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:24:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 8835 transitions. [2024-10-11 04:24:03,969 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 8835 transitions. Word has length 162 [2024-10-11 04:24:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:03,969 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 8835 transitions. [2024-10-11 04:24:03,970 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:24:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 8835 transitions. [2024-10-11 04:24:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:24:03,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:03,974 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:24:03,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:24:03,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:03,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 486644951, now seen corresponding path program 1 times [2024-10-11 04:24:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:03,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774476401] [2024-10-11 04:24:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:03,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:04,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:24:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:24:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:24:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:24:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:04,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:24:04,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:04,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774476401] [2024-10-11 04:24:04,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774476401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:04,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:04,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:04,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15968956] [2024-10-11 04:24:04,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:04,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:04,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:04,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:04,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:24:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:05,873 INFO L93 Difference]: Finished difference Result 9259 states and 15717 transitions. [2024-10-11 04:24:05,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:24:05,874 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:24:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:05,894 INFO L225 Difference]: With dead ends: 9259 [2024-10-11 04:24:05,894 INFO L226 Difference]: Without dead ends: 6271 [2024-10-11 04:24:05,905 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:24:05,906 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5202 mSDsluCounter, 12509 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:05,906 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.1s Time] [2024-10-11 04:24:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2024-10-11 04:24:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 5127. [2024-10-11 04:24:06,115 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:24:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 8826 transitions. [2024-10-11 04:24:06,129 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 8826 transitions. Word has length 162 [2024-10-11 04:24:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:06,130 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 8826 transitions. [2024-10-11 04:24:06,130 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:24:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 8826 transitions. [2024-10-11 04:24:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:24:06,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:06,133 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:24:06,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:24:06,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1130795499, now seen corresponding path program 1 times [2024-10-11 04:24:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:06,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674089324] [2024-10-11 04:24:06,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:06,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:24:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:24:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:06,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:24:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:24:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:06,428 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:24:06,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:06,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674089324] [2024-10-11 04:24:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674089324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:06,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:06,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:06,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678297140] [2024-10-11 04:24:06,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:06,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:06,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:06,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:06,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:06,431 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:24:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:10,296 INFO L93 Difference]: Finished difference Result 12710 states and 21332 transitions. [2024-10-11 04:24:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:10,297 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:24:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:10,338 INFO L225 Difference]: With dead ends: 12710 [2024-10-11 04:24:10,338 INFO L226 Difference]: Without dead ends: 9722 [2024-10-11 04:24:10,352 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:24:10,353 INFO L432 NwaCegarLoop]: 4439 mSDtfsCounter, 5459 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5478 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 3690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:10,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5478 Valid, 21880 Invalid, 3690 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:24:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9722 states. [2024-10-11 04:24:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9722 to 7779. [2024-10-11 04:24:10,692 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:24:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 13126 transitions. [2024-10-11 04:24:10,715 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 13126 transitions. Word has length 162 [2024-10-11 04:24:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:10,715 INFO L471 AbstractCegarLoop]: Abstraction has 7779 states and 13126 transitions. [2024-10-11 04:24:10,716 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:24:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 13126 transitions. [2024-10-11 04:24:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:24:10,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:10,721 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:24:10,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:24:10,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:10,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:10,722 INFO L85 PathProgramCache]: Analyzing trace with hash -767329001, now seen corresponding path program 1 times [2024-10-11 04:24:10,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:10,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137230197] [2024-10-11 04:24:10,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:10,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:10,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:10,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:24:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:10,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:24:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:24:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:10,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:24:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:10,973 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:24:10,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:10,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137230197] [2024-10-11 04:24:10,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137230197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:10,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569732273] [2024-10-11 04:24:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:10,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:10,975 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:24:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:15,317 INFO L93 Difference]: Finished difference Result 22316 states and 37122 transitions. [2024-10-11 04:24:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:15,317 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:24:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:15,377 INFO L225 Difference]: With dead ends: 22316 [2024-10-11 04:24:15,377 INFO L226 Difference]: Without dead ends: 16676 [2024-10-11 04:24:15,399 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:24:15,400 INFO L432 NwaCegarLoop]: 4439 mSDtfsCounter, 5458 mSDsluCounter, 17441 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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:24:15,400 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:24:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16676 states. [2024-10-11 04:24:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16676 to 13096. [2024-10-11 04:24:16,225 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:24:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13096 states to 13096 states and 21798 transitions. [2024-10-11 04:24:16,268 INFO L78 Accepts]: Start accepts. Automaton has 13096 states and 21798 transitions. Word has length 162 [2024-10-11 04:24:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:16,269 INFO L471 AbstractCegarLoop]: Abstraction has 13096 states and 21798 transitions. [2024-10-11 04:24:16,269 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:24:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 13096 states and 21798 transitions. [2024-10-11 04:24:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:24:16,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:16,278 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:24:16,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:24:16,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:16,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:16,279 INFO L85 PathProgramCache]: Analyzing trace with hash -478509611, now seen corresponding path program 1 times [2024-10-11 04:24:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:16,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873377441] [2024-10-11 04:24:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:16,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:16,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:24:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:16,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:24:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:16,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:24:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:24:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:16,525 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:24:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:16,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873377441] [2024-10-11 04:24:16,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873377441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:16,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:16,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583726798] [2024-10-11 04:24:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:16,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:16,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:16,527 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:24:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:20,776 INFO L93 Difference]: Finished difference Result 41527 states and 68892 transitions. [2024-10-11 04:24:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:20,777 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:24:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:21,032 INFO L225 Difference]: With dead ends: 41527 [2024-10-11 04:24:21,032 INFO L226 Difference]: Without dead ends: 30570 [2024-10-11 04:24:21,071 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:24:21,071 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.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:21,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5576 Valid, 21139 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:24:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30570 states. [2024-10-11 04:24:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30570 to 23761. [2024-10-11 04:24:22,290 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:24:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23761 states to 23761 states and 39350 transitions. [2024-10-11 04:24:22,371 INFO L78 Accepts]: Start accepts. Automaton has 23761 states and 39350 transitions. Word has length 162 [2024-10-11 04:24:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:22,371 INFO L471 AbstractCegarLoop]: Abstraction has 23761 states and 39350 transitions. [2024-10-11 04:24:22,372 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:24:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23761 states and 39350 transitions. [2024-10-11 04:24:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:24:22,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:22,389 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:24:22,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:24:22,389 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:22,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1023382185, now seen corresponding path program 1 times [2024-10-11 04:24:22,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:22,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590283575] [2024-10-11 04:24:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:22,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:24:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:24:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:24:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:24:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,621 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:24:22,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:22,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590283575] [2024-10-11 04:24:22,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590283575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:22,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:22,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:22,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188084276] [2024-10-11 04:24:22,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:22,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:22,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:22,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:22,624 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:24:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:26,026 INFO L93 Difference]: Finished difference Result 52623 states and 87952 transitions. [2024-10-11 04:24:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:24:26,026 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:24:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:26,138 INFO L225 Difference]: With dead ends: 52623 [2024-10-11 04:24:26,138 INFO L226 Difference]: Without dead ends: 31001 [2024-10-11 04:24:26,357 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:24:26,358 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 5055 mSDsluCounter, 16637 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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:24:26,359 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:24:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31001 states. [2024-10-11 04:24:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31001 to 23761. [2024-10-11 04:24:27,588 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:24:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23761 states to 23761 states and 39285 transitions. [2024-10-11 04:24:27,653 INFO L78 Accepts]: Start accepts. Automaton has 23761 states and 39285 transitions. Word has length 162 [2024-10-11 04:24:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:27,653 INFO L471 AbstractCegarLoop]: Abstraction has 23761 states and 39285 transitions. [2024-10-11 04:24:27,653 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:24:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 23761 states and 39285 transitions. [2024-10-11 04:24:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:24:27,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:27,670 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:24:27,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:24:27,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:27,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash -348222059, now seen corresponding path program 1 times [2024-10-11 04:24:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665936084] [2024-10-11 04:24:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:24:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:24:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:24:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:24:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,934 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:24:27,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:27,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665936084] [2024-10-11 04:24:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665936084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:27,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344407652] [2024-10-11 04:24:27,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:27,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:27,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:27,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:27,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:27,937 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)