./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_label43+token_ring.10.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_label43+token_ring.10.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 dc558ff06d1f59013c6fd3228f6de1555b4f43a79036afca93164a3b9d9173fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:16:45,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:16:45,280 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:16:45,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:16:45,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:16:45,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:16:45,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:16:45,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:16:45,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:16:45,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:16:45,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:16:45,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:16:45,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:16:45,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:16:45,323 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:16:45,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:16:45,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:16:45,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:16:45,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:16:45,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:16:45,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:16:45,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:16:45,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:16:45,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:16:45,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:16:45,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:16:45,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:16:45,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:16:45,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:16:45,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:16:45,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:16:45,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:16:45,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:16:45,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:16:45,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:16:45,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:16:45,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:16:45,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:16:45,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:16:45,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:16:45,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:16:45,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:16:45,330 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 -> dc558ff06d1f59013c6fd3228f6de1555b4f43a79036afca93164a3b9d9173fd [2024-10-11 04:16:45,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:16:45,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:16:45,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:16:45,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:16:45,545 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:16:45,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-1.c [2024-10-11 04:16:46,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:16:47,291 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:16:47,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-1.c [2024-10-11 04:16:47,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0d176d126/ce27340e2c4c4c52aa9b69be9f7f66d4/FLAG4f3af2122 [2024-10-11 04:16:47,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0d176d126/ce27340e2c4c4c52aa9b69be9f7f66d4 [2024-10-11 04:16:47,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:16:47,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:16:47,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:16:47,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:16:47,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:16:47,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:16:47" (1/1) ... [2024-10-11 04:16:47,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff3683b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:47, skipping insertion in model container [2024-10-11 04:16:47,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:16:47" (1/1) ... [2024-10-11 04:16:47,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:16:48,836 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_label43+token_ring.10.cil-1.c[381679,381692] [2024-10-11 04:16:48,860 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_label43+token_ring.10.cil-1.c[383339,383352] [2024-10-11 04:16:49,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:16:49,100 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:16:49,728 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_label43+token_ring.10.cil-1.c[381679,381692] [2024-10-11 04:16:49,732 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_label43+token_ring.10.cil-1.c[383339,383352] [2024-10-11 04:16:49,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:16:49,804 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:16:49,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49 WrapperNode [2024-10-11 04:16:49,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:16:49,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:16:49,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:16:49,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:16:49,813 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:16:49" (1/1) ... [2024-10-11 04:16:49,939 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:16:49" (1/1) ... [2024-10-11 04:16:50,212 INFO L138 Inliner]: procedures = 64, calls = 72, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 13119 [2024-10-11 04:16:50,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:16:50,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:16:50,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:16:50,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:16:50,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,459 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:16:50,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:16:50,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:16:50,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:16:50,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:16:50,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:50,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:16:50,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:16:50,950 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:16:50,952 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:16:51,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:16:51,016 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:16:51,016 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:16:51,016 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:16:51,017 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:16:51,017 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:16:51,017 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:16:51,017 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:16:51,018 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:16:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:16:51,021 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:16:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:16:51,021 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:16:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:16:51,021 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:16:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:16:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:16:51,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:16:51,158 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:16:51,160 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:16:57,598 INFO L? ?]: Removed 1747 outVars from TransFormulas that were not future-live. [2024-10-11 04:16:57,599 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:16:57,685 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:16:57,686 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-11 04:16:57,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:16:57 BoogieIcfgContainer [2024-10-11 04:16:57,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:16:57,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:16:57,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:16:57,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:16:57,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:16:47" (1/3) ... [2024-10-11 04:16:57,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287b8ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:16:57, skipping insertion in model container [2024-10-11 04:16:57,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49" (2/3) ... [2024-10-11 04:16:57,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287b8ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:16:57, skipping insertion in model container [2024-10-11 04:16:57,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:16:57" (3/3) ... [2024-10-11 04:16:57,696 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.10.cil-1.c [2024-10-11 04:16:57,710 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:16:57,711 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:16:57,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:16:57,824 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;@5089532, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:16:57,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:16:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 2433 states, 2397 states have (on average 1.8777638715060492) internal successors, (4501), 2402 states have internal predecessors, (4501), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:16:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:16:57,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:57,864 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] [2024-10-11 04:16:57,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:57,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 177610299, now seen corresponding path program 1 times [2024-10-11 04:16:57,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:57,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054274959] [2024-10-11 04:16:57,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:57,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:58,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:16:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:58,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:16:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:58,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:16:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:16:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:58,350 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:16:58,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:58,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054274959] [2024-10-11 04:16:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054274959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:58,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:16:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503383548] [2024-10-11 04:16:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:58,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:16:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:58,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:16:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:16:58,399 INFO L87 Difference]: Start difference. First operand has 2433 states, 2397 states have (on average 1.8777638715060492) internal successors, (4501), 2402 states have internal predecessors, (4501), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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:17:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:00,167 INFO L93 Difference]: Finished difference Result 4967 states and 9286 transitions. [2024-10-11 04:17:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:17:00,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:00,201 INFO L225 Difference]: With dead ends: 4967 [2024-10-11 04:17:00,201 INFO L226 Difference]: Without dead ends: 2538 [2024-10-11 04:17:00,210 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:17:00,215 INFO L432 NwaCegarLoop]: 4230 mSDtfsCounter, 851 mSDsluCounter, 12178 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 16408 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:00,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 16408 Invalid, 968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:17:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2024-10-11 04:17:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2428. [2024-10-11 04:17:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 2394 states have (on average 1.840016708437761) internal successors, (4405), 2397 states have internal predecessors, (4405), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 04:17:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4455 transitions. [2024-10-11 04:17:00,370 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4455 transitions. Word has length 142 [2024-10-11 04:17:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:00,371 INFO L471 AbstractCegarLoop]: Abstraction has 2428 states and 4455 transitions. [2024-10-11 04:17:00,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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:17:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4455 transitions. [2024-10-11 04:17:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:00,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:00,375 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] [2024-10-11 04:17:00,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:17:00,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:00,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash 722482873, now seen corresponding path program 1 times [2024-10-11 04:17:00,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:00,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087020137] [2024-10-11 04:17:00,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,794 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:17:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:00,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087020137] [2024-10-11 04:17:00,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087020137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:00,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298228301] [2024-10-11 04:17:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:00,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:00,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:00,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:00,798 INFO L87 Difference]: Start difference. First operand 2428 states and 4455 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:04,094 INFO L93 Difference]: Finished difference Result 3266 states and 5862 transitions. [2024-10-11 04:17:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:04,106 INFO L225 Difference]: With dead ends: 3266 [2024-10-11 04:17:04,106 INFO L226 Difference]: Without dead ends: 2975 [2024-10-11 04:17:04,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:04,110 INFO L432 NwaCegarLoop]: 4383 mSDtfsCounter, 5177 mSDsluCounter, 17236 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5194 SdHoareTripleChecker+Valid, 21619 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:04,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5194 Valid, 21619 Invalid, 3373 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 3307 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:17:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2024-10-11 04:17:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2736. [2024-10-11 04:17:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2673 states have (on average 1.8204264870931537) internal successors, (4866), 2678 states have internal predecessors, (4866), 47 states have call successors, (47), 13 states have call predecessors, (47), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-11 04:17:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 4965 transitions. [2024-10-11 04:17:04,191 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 4965 transitions. Word has length 142 [2024-10-11 04:17:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:04,191 INFO L471 AbstractCegarLoop]: Abstraction has 2736 states and 4965 transitions. [2024-10-11 04:17:04,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 4965 transitions. [2024-10-11 04:17:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:04,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:04,194 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] [2024-10-11 04:17:04,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:17:04,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:04,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:04,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1327926025, now seen corresponding path program 1 times [2024-10-11 04:17:04,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:04,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235060897] [2024-10-11 04:17:04,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:04,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,514 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:17:04,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235060897] [2024-10-11 04:17:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235060897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:04,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:04,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311428044] [2024-10-11 04:17:04,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:04,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:04,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:04,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:04,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:04,521 INFO L87 Difference]: Start difference. First operand 2736 states and 4965 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:07,266 INFO L93 Difference]: Finished difference Result 4324 states and 7612 transitions. [2024-10-11 04:17:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:07,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:07,281 INFO L225 Difference]: With dead ends: 4324 [2024-10-11 04:17:07,281 INFO L226 Difference]: Without dead ends: 3727 [2024-10-11 04:17:07,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:07,286 INFO L432 NwaCegarLoop]: 4334 mSDtfsCounter, 5218 mSDsluCounter, 17172 mSDsCounter, 0 mSdLazyCounter, 3009 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5235 SdHoareTripleChecker+Valid, 21506 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:07,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5235 Valid, 21506 Invalid, 3083 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 3009 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 04:17:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2024-10-11 04:17:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3300. [2024-10-11 04:17:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.7886970172684458) internal successors, (5697), 3192 states have internal predecessors, (5697), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:17:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5882 transitions. [2024-10-11 04:17:07,400 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5882 transitions. Word has length 142 [2024-10-11 04:17:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:07,401 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5882 transitions. [2024-10-11 04:17:07,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5882 transitions. [2024-10-11 04:17:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:07,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:07,404 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] [2024-10-11 04:17:07,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:17:07,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:07,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash -839878919, now seen corresponding path program 1 times [2024-10-11 04:17:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:07,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130945285] [2024-10-11 04:17:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,651 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:17:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:07,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130945285] [2024-10-11 04:17:07,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130945285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:07,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:07,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000430423] [2024-10-11 04:17:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:07,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:07,653 INFO L87 Difference]: Start difference. First operand 3300 states and 5882 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:09,129 INFO L93 Difference]: Finished difference Result 4901 states and 8568 transitions. [2024-10-11 04:17:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:09,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:09,143 INFO L225 Difference]: With dead ends: 4901 [2024-10-11 04:17:09,143 INFO L226 Difference]: Without dead ends: 3738 [2024-10-11 04:17:09,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:09,150 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4885 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:09,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 20718 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:17:09,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2024-10-11 04:17:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3300. [2024-10-11 04:17:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.78712715855573) internal successors, (5692), 3192 states have internal predecessors, (5692), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:17:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5877 transitions. [2024-10-11 04:17:09,326 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5877 transitions. Word has length 142 [2024-10-11 04:17:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:09,326 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5877 transitions. [2024-10-11 04:17:09,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5877 transitions. [2024-10-11 04:17:09,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:09,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:09,329 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] [2024-10-11 04:17:09,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:17:09,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1932514121, now seen corresponding path program 1 times [2024-10-11 04:17:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727477153] [2024-10-11 04:17:09,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:09,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:09,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:09,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:09,588 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:17:09,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:09,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727477153] [2024-10-11 04:17:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727477153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:09,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:09,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925317809] [2024-10-11 04:17:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:09,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:09,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:09,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:09,595 INFO L87 Difference]: Start difference. First operand 3300 states and 5877 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:10,922 INFO L93 Difference]: Finished difference Result 4897 states and 8547 transitions. [2024-10-11 04:17:10,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:10,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:10,936 INFO L225 Difference]: With dead ends: 4897 [2024-10-11 04:17:10,936 INFO L226 Difference]: Without dead ends: 3734 [2024-10-11 04:17:10,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:10,942 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4883 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4901 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:10,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4901 Valid, 20718 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:17:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2024-10-11 04:17:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3300. [2024-10-11 04:17:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.785557299843014) internal successors, (5687), 3192 states have internal predecessors, (5687), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:17:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5872 transitions. [2024-10-11 04:17:11,031 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5872 transitions. Word has length 142 [2024-10-11 04:17:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:11,032 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5872 transitions. [2024-10-11 04:17:11,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5872 transitions. [2024-10-11 04:17:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:11,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:11,034 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] [2024-10-11 04:17:11,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:17:11,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:11,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1080280889, now seen corresponding path program 1 times [2024-10-11 04:17:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:11,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953801880] [2024-10-11 04:17:11,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:11,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,234 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:17:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953801880] [2024-10-11 04:17:11,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953801880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:11,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787584417] [2024-10-11 04:17:11,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:11,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:11,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:11,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:11,238 INFO L87 Difference]: Start difference. First operand 3300 states and 5872 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:12,573 INFO L93 Difference]: Finished difference Result 4892 states and 8524 transitions. [2024-10-11 04:17:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:12,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:12,586 INFO L225 Difference]: With dead ends: 4892 [2024-10-11 04:17:12,586 INFO L226 Difference]: Without dead ends: 3729 [2024-10-11 04:17:12,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:12,592 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4881 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4899 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:12,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4899 Valid, 20718 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:17:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2024-10-11 04:17:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3300. [2024-10-11 04:17:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.7839874411302983) internal successors, (5682), 3192 states have internal predecessors, (5682), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:17:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5867 transitions. [2024-10-11 04:17:12,729 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5867 transitions. Word has length 142 [2024-10-11 04:17:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:12,730 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5867 transitions. [2024-10-11 04:17:12,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5867 transitions. [2024-10-11 04:17:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:12,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:12,733 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] [2024-10-11 04:17:12,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:17:12,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:12,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash -762194825, now seen corresponding path program 1 times [2024-10-11 04:17:12,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:12,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304668261] [2024-10-11 04:17:12,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:12,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:12,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:12,979 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:17:12,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304668261] [2024-10-11 04:17:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304668261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:12,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:12,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:12,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005335807] [2024-10-11 04:17:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:12,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:12,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:12,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:12,983 INFO L87 Difference]: Start difference. First operand 3300 states and 5867 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:16,044 INFO L93 Difference]: Finished difference Result 6373 states and 10927 transitions. [2024-10-11 04:17:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:16,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:16,066 INFO L225 Difference]: With dead ends: 6373 [2024-10-11 04:17:16,067 INFO L226 Difference]: Without dead ends: 5212 [2024-10-11 04:17:16,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:16,078 INFO L432 NwaCegarLoop]: 4380 mSDtfsCounter, 5168 mSDsluCounter, 17236 mSDsCounter, 0 mSdLazyCounter, 3213 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5185 SdHoareTripleChecker+Valid, 21616 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:16,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5185 Valid, 21616 Invalid, 3281 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 3213 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 04:17:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2024-10-11 04:17:16,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 4439. [2024-10-11 04:17:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4220 states have (on average 1.740047393364929) internal successors, (7343), 4231 states have internal predecessors, (7343), 161 states have call successors, (161), 49 states have call predecessors, (161), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-11 04:17:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7706 transitions. [2024-10-11 04:17:16,267 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7706 transitions. Word has length 142 [2024-10-11 04:17:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:16,267 INFO L471 AbstractCegarLoop]: Abstraction has 4439 states and 7706 transitions. [2024-10-11 04:17:16,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7706 transitions. [2024-10-11 04:17:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:16,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:16,272 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] [2024-10-11 04:17:16,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:17:16,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:16,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:16,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1810769785, now seen corresponding path program 1 times [2024-10-11 04:17:16,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:16,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867033619] [2024-10-11 04:17:16,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:16,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:16,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:16,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:16,454 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:17:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:16,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867033619] [2024-10-11 04:17:16,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867033619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:16,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:16,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117472928] [2024-10-11 04:17:16,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:16,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:16,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:16,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:16,456 INFO L87 Difference]: Start difference. First operand 4439 states and 7706 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:17,878 INFO L93 Difference]: Finished difference Result 7548 states and 12863 transitions. [2024-10-11 04:17:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:17,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:17,898 INFO L225 Difference]: With dead ends: 7548 [2024-10-11 04:17:17,898 INFO L226 Difference]: Without dead ends: 5246 [2024-10-11 04:17:17,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:17,908 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4885 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:17,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 20718 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:17:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2024-10-11 04:17:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 4439. [2024-10-11 04:17:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4220 states have (on average 1.7379146919431279) internal successors, (7334), 4231 states have internal predecessors, (7334), 161 states have call successors, (161), 49 states have call predecessors, (161), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-11 04:17:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7697 transitions. [2024-10-11 04:17:18,060 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7697 transitions. Word has length 142 [2024-10-11 04:17:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:18,060 INFO L471 AbstractCegarLoop]: Abstraction has 4439 states and 7697 transitions. [2024-10-11 04:17:18,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7697 transitions. [2024-10-11 04:17:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:18,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:18,063 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] [2024-10-11 04:17:18,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:17:18,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:18,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1478126647, now seen corresponding path program 1 times [2024-10-11 04:17:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:18,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077558858] [2024-10-11 04:17:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:18,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:18,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:18,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:18,292 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:17:18,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077558858] [2024-10-11 04:17:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077558858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:18,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:18,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397312334] [2024-10-11 04:17:18,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:18,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:18,295 INFO L87 Difference]: Start difference. First operand 4439 states and 7697 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:20,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:20,957 INFO L93 Difference]: Finished difference Result 10480 states and 17612 transitions. [2024-10-11 04:17:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:20,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:20,981 INFO L225 Difference]: With dead ends: 10480 [2024-10-11 04:17:20,982 INFO L226 Difference]: Without dead ends: 8180 [2024-10-11 04:17:20,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:20,992 INFO L432 NwaCegarLoop]: 4380 mSDtfsCounter, 5200 mSDsluCounter, 17236 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5217 SdHoareTripleChecker+Valid, 21616 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:20,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5217 Valid, 21616 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3093 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:17:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2024-10-11 04:17:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 6739. [2024-10-11 04:17:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6739 states, 6312 states have (on average 1.692173637515843) internal successors, (10681), 6331 states have internal predecessors, (10681), 313 states have call successors, (313), 97 states have call predecessors, (313), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-10-11 04:17:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6739 states to 6739 states and 11418 transitions. [2024-10-11 04:17:21,417 INFO L78 Accepts]: Start accepts. Automaton has 6739 states and 11418 transitions. Word has length 142 [2024-10-11 04:17:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:21,417 INFO L471 AbstractCegarLoop]: Abstraction has 6739 states and 11418 transitions. [2024-10-11 04:17:21,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6739 states and 11418 transitions. [2024-10-11 04:17:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:21,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:21,422 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] [2024-10-11 04:17:21,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:17:21,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:21,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -814954379, now seen corresponding path program 1 times [2024-10-11 04:17:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715697164] [2024-10-11 04:17:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:21,585 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:17:21,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:21,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715697164] [2024-10-11 04:17:21,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715697164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:21,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:21,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:21,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276617052] [2024-10-11 04:17:21,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:21,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:21,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:21,587 INFO L87 Difference]: Start difference. First operand 6739 states and 11418 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:24,280 INFO L93 Difference]: Finished difference Result 18724 states and 31133 transitions. [2024-10-11 04:17:24,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:24,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:24,333 INFO L225 Difference]: With dead ends: 18724 [2024-10-11 04:17:24,333 INFO L226 Difference]: Without dead ends: 14124 [2024-10-11 04:17:24,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:24,353 INFO L432 NwaCegarLoop]: 4333 mSDtfsCounter, 5226 mSDsluCounter, 17172 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5243 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:24,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5243 Valid, 21505 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:17:24,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14124 states. [2024-10-11 04:17:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14124 to 11355. [2024-10-11 04:17:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11355 states, 10512 states have (on average 1.65515601217656) internal successors, (17399), 10547 states have internal predecessors, (17399), 617 states have call successors, (617), 193 states have call predecessors, (617), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-10-11 04:17:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 18938 transitions. [2024-10-11 04:17:24,915 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 18938 transitions. Word has length 142 [2024-10-11 04:17:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:24,915 INFO L471 AbstractCegarLoop]: Abstraction has 11355 states and 18938 transitions. [2024-10-11 04:17:24,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 18938 transitions. [2024-10-11 04:17:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:24,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:24,921 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] [2024-10-11 04:17:24,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:17:24,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:24,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash 912190583, now seen corresponding path program 1 times [2024-10-11 04:17:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250151825] [2024-10-11 04:17:24,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:24,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,096 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:17:25,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:25,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250151825] [2024-10-11 04:17:25,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250151825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:25,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:25,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:25,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410488384] [2024-10-11 04:17:25,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:25,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:25,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:25,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:25,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:25,098 INFO L87 Difference]: Start difference. First operand 11355 states and 18938 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:28,833 INFO L93 Difference]: Finished difference Result 39308 states and 64993 transitions. [2024-10-11 04:17:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:28,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:28,945 INFO L225 Difference]: With dead ends: 39308 [2024-10-11 04:17:28,945 INFO L226 Difference]: Without dead ends: 30092 [2024-10-11 04:17:28,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:17:28,979 INFO L432 NwaCegarLoop]: 4380 mSDtfsCounter, 5566 mSDsluCounter, 17231 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5594 SdHoareTripleChecker+Valid, 21611 SdHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:28,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5594 Valid, 21611 Invalid, 3138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3067 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 04:17:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30092 states. [2024-10-11 04:17:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30092 to 20555. [2024-10-11 04:17:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20555 states, 18912 states have (on average 1.6312923011844331) internal successors, (30851), 18979 states have internal predecessors, (30851), 1193 states have call successors, (1193), 385 states have call predecessors, (1193), 448 states have return successors, (2048), 1254 states have call predecessors, (2048), 1191 states have call successors, (2048) [2024-10-11 04:17:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20555 states to 20555 states and 34092 transitions. [2024-10-11 04:17:30,263 INFO L78 Accepts]: Start accepts. Automaton has 20555 states and 34092 transitions. Word has length 142 [2024-10-11 04:17:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:30,263 INFO L471 AbstractCegarLoop]: Abstraction has 20555 states and 34092 transitions. [2024-10-11 04:17:30,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 20555 states and 34092 transitions. [2024-10-11 04:17:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:30,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:30,276 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] [2024-10-11 04:17:30,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:17:30,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:30,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:30,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1383546933, now seen corresponding path program 1 times [2024-10-11 04:17:30,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:30,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115075384] [2024-10-11 04:17:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:30,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:30,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:30,487 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:17:30,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:30,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115075384] [2024-10-11 04:17:30,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115075384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:30,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:30,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:30,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966241703] [2024-10-11 04:17:30,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:30,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:30,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:30,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:30,490 INFO L87 Difference]: Start difference. First operand 20555 states and 34092 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:35,572 INFO L93 Difference]: Finished difference Result 75484 states and 125245 transitions. [2024-10-11 04:17:35,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:35,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:35,776 INFO L225 Difference]: With dead ends: 75484 [2024-10-11 04:17:35,777 INFO L226 Difference]: Without dead ends: 57068 [2024-10-11 04:17:35,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:17:35,829 INFO L432 NwaCegarLoop]: 4376 mSDtfsCounter, 5285 mSDsluCounter, 17228 mSDsCounter, 0 mSdLazyCounter, 3603 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5301 SdHoareTripleChecker+Valid, 21604 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:35,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5301 Valid, 21604 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3603 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:17:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57068 states. [2024-10-11 04:17:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57068 to 38315. [2024-10-11 04:17:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38315 states, 35104 states have (on average 1.614260483135825) internal successors, (56667), 35235 states have internal predecessors, (56667), 2313 states have call successors, (2313), 769 states have call predecessors, (2313), 896 states have return successors, (4754), 2438 states have call predecessors, (4754), 2311 states have call successors, (4754) [2024-10-11 04:17:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38315 states to 38315 states and 63734 transitions. [2024-10-11 04:17:37,962 INFO L78 Accepts]: Start accepts. Automaton has 38315 states and 63734 transitions. Word has length 142 [2024-10-11 04:17:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:37,963 INFO L471 AbstractCegarLoop]: Abstraction has 38315 states and 63734 transitions. [2024-10-11 04:17:37,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 38315 states and 63734 transitions. [2024-10-11 04:17:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:37,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:37,984 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] [2024-10-11 04:17:37,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:17:37,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:37,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash -263816009, now seen corresponding path program 1 times [2024-10-11 04:17:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656524713] [2024-10-11 04:17:37,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:37,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:38,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:38,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:38,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:38,155 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:17:38,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:38,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656524713] [2024-10-11 04:17:38,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656524713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:38,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:38,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996869598] [2024-10-11 04:17:38,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:38,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:38,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:38,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:38,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:38,157 INFO L87 Difference]: Start difference. First operand 38315 states and 63734 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:45,733 INFO L93 Difference]: Finished difference Result 145020 states and 242573 transitions. [2024-10-11 04:17:45,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:45,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:17:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:46,109 INFO L225 Difference]: With dead ends: 145020 [2024-10-11 04:17:46,109 INFO L226 Difference]: Without dead ends: 108844 [2024-10-11 04:17:46,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:17:46,201 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5498 mSDsluCounter, 17231 mSDsCounter, 0 mSdLazyCounter, 3036 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5526 SdHoareTripleChecker+Valid, 21610 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:46,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5526 Valid, 21610 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3036 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:17:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108844 states. [2024-10-11 04:17:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108844 to 74475. [2024-10-11 04:17:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74475 states, 68192 states have (on average 1.606918700140779) internal successors, (109579), 68451 states have internal predecessors, (109579), 4489 states have call successors, (4489), 1537 states have call predecessors, (4489), 1792 states have return successors, (11560), 4742 states have call predecessors, (11560), 4487 states have call successors, (11560) [2024-10-11 04:17:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74475 states to 74475 states and 125628 transitions. [2024-10-11 04:17:50,889 INFO L78 Accepts]: Start accepts. Automaton has 74475 states and 125628 transitions. Word has length 142 [2024-10-11 04:17:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:50,889 INFO L471 AbstractCegarLoop]: Abstraction has 74475 states and 125628 transitions. [2024-10-11 04:17:50,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:17:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 74475 states and 125628 transitions. [2024-10-11 04:17:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:17:50,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:50,925 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] [2024-10-11 04:17:50,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:17:50,926 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:50,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1899800565, now seen corresponding path program 1 times [2024-10-11 04:17:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:50,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424182645] [2024-10-11 04:17:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:50,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:51,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:51,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:51,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:51,083 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:17:51,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:51,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424182645] [2024-10-11 04:17:51,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424182645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:51,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:51,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:51,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754567376] [2024-10-11 04:17:51,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:51,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:51,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:51,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:51,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:51,085 INFO L87 Difference]: Start difference. First operand 74475 states and 125628 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:18:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:05,538 INFO L93 Difference]: Finished difference Result 283964 states and 483061 transitions. [2024-10-11 04:18:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:18:05,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:18:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted.