./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_label49+token_ring.03.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_label49+token_ring.03.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 45212159197fe0bc553796025c4b5584a047c150b6d840572b407bf4bd1f9446 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:26:17,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:26:17,371 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:26:17,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:26:17,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:26:17,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:26:17,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:26:17,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:26:17,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:26:17,395 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:26:17,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:26:17,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:26:17,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:26:17,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:26:17,397 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:26:17,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:26:17,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:26:17,398 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:26:17,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:26:17,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:26:17,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:26:17,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:26:17,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:26:17,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:26:17,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:26:17,401 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:26:17,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:26:17,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:26:17,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:26:17,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:26:17,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:26:17,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:26:17,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:26:17,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:26:17,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:26:17,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:26:17,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:26:17,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:26:17,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:26:17,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:26:17,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:26:17,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:26:17,406 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 -> 45212159197fe0bc553796025c4b5584a047c150b6d840572b407bf4bd1f9446 [2024-10-11 04:26:17,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:26:17,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:26:17,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:26:17,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:26:17,697 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:26:17,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c [2024-10-11 04:26:19,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:26:19,799 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:26:19,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c [2024-10-11 04:26:19,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1b4788095/8edae4dc774a4c819c5bcc2d2e19ec4a/FLAGeb97c8909 [2024-10-11 04:26:20,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1b4788095/8edae4dc774a4c819c5bcc2d2e19ec4a [2024-10-11 04:26:20,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:26:20,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:26:20,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:26:20,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:26:20,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:26:20,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:26:20" (1/1) ... [2024-10-11 04:26:20,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fab835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:20, skipping insertion in model container [2024-10-11 04:26:20,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:26:20" (1/1) ... [2024-10-11 04:26:20,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:26:22,026 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_label49+token_ring.03.cil-1.c[380593,380606] [2024-10-11 04:26:22,057 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_label49+token_ring.03.cil-1.c[383339,383352] [2024-10-11 04:26:22,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:26:22,235 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:26:23,032 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_label49+token_ring.03.cil-1.c[380593,380606] [2024-10-11 04:26:23,040 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_label49+token_ring.03.cil-1.c[383339,383352] [2024-10-11 04:26:23,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:26:23,114 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:26:23,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23 WrapperNode [2024-10-11 04:26:23,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:26:23,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:26:23,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:26:23,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:26:23,123 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:26:23" (1/1) ... [2024-10-11 04:26:23,203 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:26:23" (1/1) ... [2024-10-11 04:26:23,610 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12699 [2024-10-11 04:26:23,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:26:23,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:26:23,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:26:23,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:26:23,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:23,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:23,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:23,794 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:26:23,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:23,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:24,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:24,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:24,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:24,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:24,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:26:24,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:26:24,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:26:24,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:26:24,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (1/1) ... [2024-10-11 04:26:24,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:26:24,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:26:24,455 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:26:24,464 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:26:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:26:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:26:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:26:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:26:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:26:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:26:24,522 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:26:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:26:24,522 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:26:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:26:24,523 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:26:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:26:24,523 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:26:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:26:24,523 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:26:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:26:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:26:24,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:26:24,628 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:26:24,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:26:32,845 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2024-10-11 04:26:32,845 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:26:32,971 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:26:32,971 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-11 04:26:32,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:26:32 BoogieIcfgContainer [2024-10-11 04:26:32,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:26:32,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:26:32,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:26:32,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:26:32,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:26:20" (1/3) ... [2024-10-11 04:26:32,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17129ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:26:32, skipping insertion in model container [2024-10-11 04:26:32,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:26:23" (2/3) ... [2024-10-11 04:26:32,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17129ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:26:32, skipping insertion in model container [2024-10-11 04:26:32,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:26:32" (3/3) ... [2024-10-11 04:26:32,983 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.03.cil-1.c [2024-10-11 04:26:33,001 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:26:33,002 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:26:33,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:26:33,147 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;@352d89f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:26:33,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:26:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 04:26:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:26:33,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:33,184 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] [2024-10-11 04:26:33,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:33,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:33,191 INFO L85 PathProgramCache]: Analyzing trace with hash 910636931, now seen corresponding path program 1 times [2024-10-11 04:26:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:33,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24035209] [2024-10-11 04:26:33,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:33,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:33,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:33,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:33,814 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:26:33,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24035209] [2024-10-11 04:26:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24035209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:33,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:26:33,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:26:33,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925345942] [2024-10-11 04:26:33,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:33,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:26:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:33,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:26:33,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:26:33,862 INFO L87 Difference]: Start difference. First operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:26:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:35,308 INFO L93 Difference]: Finished difference Result 4754 states and 8887 transitions. [2024-10-11 04:26:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:26:35,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2024-10-11 04:26:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:35,345 INFO L225 Difference]: With dead ends: 4754 [2024-10-11 04:26:35,345 INFO L226 Difference]: Without dead ends: 2485 [2024-10-11 04:26:35,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:26:35,366 INFO L432 NwaCegarLoop]: 4085 mSDtfsCounter, 4475 mSDsluCounter, 12233 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4485 SdHoareTripleChecker+Valid, 16318 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:35,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4485 Valid, 16318 Invalid, 877 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:26:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2024-10-11 04:26:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2404. [2024-10-11 04:26:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.8379983036471585) internal successors, (4334), 2362 states have internal predecessors, (4334), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-10-11 04:26:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4397 transitions. [2024-10-11 04:26:35,551 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4397 transitions. Word has length 72 [2024-10-11 04:26:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:35,553 INFO L471 AbstractCegarLoop]: Abstraction has 2404 states and 4397 transitions. [2024-10-11 04:26:35,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:26:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4397 transitions. [2024-10-11 04:26:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:26:35,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:35,558 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] [2024-10-11 04:26:35,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:26:35,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:35,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1174500479, now seen corresponding path program 1 times [2024-10-11 04:26:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930337484] [2024-10-11 04:26:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:35,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:35,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:35,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:35,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:35,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:35,800 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:26:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:35,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930337484] [2024-10-11 04:26:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930337484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:35,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:26:35,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:26:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582343615] [2024-10-11 04:26:35,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:35,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:26:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:26:35,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:35,809 INFO L87 Difference]: Start difference. First operand 2404 states and 4397 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:37,302 INFO L93 Difference]: Finished difference Result 2937 states and 5237 transitions. [2024-10-11 04:26:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:26:37,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-11 04:26:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:37,317 INFO L225 Difference]: With dead ends: 2937 [2024-10-11 04:26:37,318 INFO L226 Difference]: Without dead ends: 2663 [2024-10-11 04:26:37,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:26:37,322 INFO L432 NwaCegarLoop]: 4173 mSDtfsCounter, 4467 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 20675 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:37,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 20675 Invalid, 1348 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:26:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-11 04:26:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2532. [2024-10-11 04:26:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2467 states have (on average 1.8252938792055127) internal successors, (4503), 2472 states have internal predecessors, (4503), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-10-11 04:26:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 4592 transitions. [2024-10-11 04:26:37,419 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 4592 transitions. Word has length 72 [2024-10-11 04:26:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:37,419 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 4592 transitions. [2024-10-11 04:26:37,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 4592 transitions. [2024-10-11 04:26:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:26:37,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:37,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] [2024-10-11 04:26:37,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:26:37,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:37,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1735200257, now seen corresponding path program 1 times [2024-10-11 04:26:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:37,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061891565] [2024-10-11 04:26:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:37,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:37,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:37,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:37,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:37,577 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:26:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061891565] [2024-10-11 04:26:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061891565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:37,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:26:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:26:37,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760379792] [2024-10-11 04:26:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:37,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:26:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:37,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:26:37,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:37,581 INFO L87 Difference]: Start difference. First operand 2532 states and 4592 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:38,938 INFO L93 Difference]: Finished difference Result 3398 states and 5954 transitions. [2024-10-11 04:26:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:26:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-11 04:26:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:38,953 INFO L225 Difference]: With dead ends: 3398 [2024-10-11 04:26:38,954 INFO L226 Difference]: Without dead ends: 2996 [2024-10-11 04:26:38,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:26:38,958 INFO L432 NwaCegarLoop]: 4171 mSDtfsCounter, 4465 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 20673 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:38,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 20673 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:26:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2024-10-11 04:26:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2789. [2024-10-11 04:26:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2686 states have (on average 1.802680565897245) internal successors, (4842), 2693 states have internal predecessors, (4842), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-11 04:26:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4987 transitions. [2024-10-11 04:26:39,097 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4987 transitions. Word has length 72 [2024-10-11 04:26:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:39,099 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4987 transitions. [2024-10-11 04:26:39,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4987 transitions. [2024-10-11 04:26:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:26:39,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:39,103 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] [2024-10-11 04:26:39,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:26:39,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:39,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2126037953, now seen corresponding path program 1 times [2024-10-11 04:26:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:39,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439177506] [2024-10-11 04:26:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:39,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:39,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:39,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:39,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:39,323 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:26:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:39,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439177506] [2024-10-11 04:26:39,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439177506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:39,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:26:39,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:26:39,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310025257] [2024-10-11 04:26:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:39,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:26:39,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:39,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:26:39,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:39,328 INFO L87 Difference]: Start difference. First operand 2789 states and 4987 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:40,064 INFO L93 Difference]: Finished difference Result 3643 states and 6340 transitions. [2024-10-11 04:26:40,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:26:40,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-11 04:26:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:40,080 INFO L225 Difference]: With dead ends: 3643 [2024-10-11 04:26:40,080 INFO L226 Difference]: Without dead ends: 2984 [2024-10-11 04:26:40,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:26:40,085 INFO L432 NwaCegarLoop]: 4068 mSDtfsCounter, 4402 mSDsluCounter, 12126 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4413 SdHoareTripleChecker+Valid, 16194 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:40,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4413 Valid, 16194 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:26:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2024-10-11 04:26:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2789. [2024-10-11 04:26:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2686 states have (on average 1.800819061801936) internal successors, (4837), 2693 states have internal predecessors, (4837), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-11 04:26:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4982 transitions. [2024-10-11 04:26:40,208 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4982 transitions. Word has length 72 [2024-10-11 04:26:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:40,209 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4982 transitions. [2024-10-11 04:26:40,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4982 transitions. [2024-10-11 04:26:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:26:40,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:40,214 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] [2024-10-11 04:26:40,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:26:40,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:40,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash -865120703, now seen corresponding path program 1 times [2024-10-11 04:26:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889781154] [2024-10-11 04:26:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:40,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:40,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:40,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:40,367 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:26:40,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889781154] [2024-10-11 04:26:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889781154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:40,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:26:40,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:26:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921678371] [2024-10-11 04:26:40,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:40,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:26:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:26:40,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:40,370 INFO L87 Difference]: Start difference. First operand 2789 states and 4982 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:41,813 INFO L93 Difference]: Finished difference Result 4456 states and 7571 transitions. [2024-10-11 04:26:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:26:41,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-11 04:26:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:41,832 INFO L225 Difference]: With dead ends: 4456 [2024-10-11 04:26:41,833 INFO L226 Difference]: Without dead ends: 3797 [2024-10-11 04:26:41,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:26:41,838 INFO L432 NwaCegarLoop]: 4169 mSDtfsCounter, 4572 mSDsluCounter, 16497 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4586 SdHoareTripleChecker+Valid, 20666 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:41,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4586 Valid, 20666 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:26:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2024-10-11 04:26:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3300. [2024-10-11 04:26:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3125 states have (on average 1.76384) internal successors, (5512), 3136 states have internal predecessors, (5512), 111 states have call successors, (111), 55 states have call predecessors, (111), 62 states have return successors, (144), 116 states have call predecessors, (144), 109 states have call successors, (144) [2024-10-11 04:26:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5767 transitions. [2024-10-11 04:26:41,972 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5767 transitions. Word has length 72 [2024-10-11 04:26:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:41,972 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5767 transitions. [2024-10-11 04:26:41,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5767 transitions. [2024-10-11 04:26:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:26:41,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:41,975 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] [2024-10-11 04:26:41,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:26:41,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:41,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash -824445953, now seen corresponding path program 1 times [2024-10-11 04:26:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960834160] [2024-10-11 04:26:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:41,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:42,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:42,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:42,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:42,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:42,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:42,131 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:26:42,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:42,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960834160] [2024-10-11 04:26:42,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960834160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:42,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:26:42,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:26:42,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801166275] [2024-10-11 04:26:42,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:42,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:26:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:42,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:26:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:42,135 INFO L87 Difference]: Start difference. First operand 3300 states and 5767 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:43,459 INFO L93 Difference]: Finished difference Result 6297 states and 10420 transitions. [2024-10-11 04:26:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:26:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-11 04:26:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:43,493 INFO L225 Difference]: With dead ends: 6297 [2024-10-11 04:26:43,493 INFO L226 Difference]: Without dead ends: 5127 [2024-10-11 04:26:43,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:26:43,503 INFO L432 NwaCegarLoop]: 4168 mSDtfsCounter, 4474 mSDsluCounter, 16494 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 20662 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:43,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 20662 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:26:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2024-10-11 04:26:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 4238. [2024-10-11 04:26:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4238 states, 3923 states have (on average 1.712464950293143) internal successors, (6718), 3942 states have internal predecessors, (6718), 195 states have call successors, (195), 103 states have call predecessors, (195), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2024-10-11 04:26:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 7203 transitions. [2024-10-11 04:26:43,720 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 7203 transitions. Word has length 72 [2024-10-11 04:26:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:43,721 INFO L471 AbstractCegarLoop]: Abstraction has 4238 states and 7203 transitions. [2024-10-11 04:26:43,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 7203 transitions. [2024-10-11 04:26:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:26:43,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:43,725 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] [2024-10-11 04:26:43,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:26:43,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:43,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash 562339457, now seen corresponding path program 1 times [2024-10-11 04:26:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388526805] [2024-10-11 04:26:43,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:43,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:43,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:43,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:43,865 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:26:43,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:43,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388526805] [2024-10-11 04:26:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388526805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:43,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:26:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:26:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449670747] [2024-10-11 04:26:43,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:43,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:26:43,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:43,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:26:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:43,867 INFO L87 Difference]: Start difference. First operand 4238 states and 7203 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:45,422 INFO L93 Difference]: Finished difference Result 9417 states and 15228 transitions. [2024-10-11 04:26:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:26:45,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2024-10-11 04:26:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:45,471 INFO L225 Difference]: With dead ends: 9417 [2024-10-11 04:26:45,472 INFO L226 Difference]: Without dead ends: 7309 [2024-10-11 04:26:45,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:26:45,483 INFO L432 NwaCegarLoop]: 4169 mSDtfsCounter, 4462 mSDsluCounter, 16497 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 20666 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:45,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4476 Valid, 20666 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:26:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2024-10-11 04:26:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 6209. [2024-10-11 04:26:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6209 states, 5622 states have (on average 1.6577730345072927) internal successors, (9320), 5657 states have internal predecessors, (9320), 355 states have call successors, (355), 199 states have call predecessors, (355), 230 states have return successors, (628), 384 states have call predecessors, (628), 353 states have call successors, (628) [2024-10-11 04:26:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 10303 transitions. [2024-10-11 04:26:45,801 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 10303 transitions. Word has length 72 [2024-10-11 04:26:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:45,801 INFO L471 AbstractCegarLoop]: Abstraction has 6209 states and 10303 transitions. [2024-10-11 04:26:45,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:26:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 10303 transitions. [2024-10-11 04:26:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:26:45,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:45,806 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] [2024-10-11 04:26:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:26:45,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:45,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1006240131, now seen corresponding path program 1 times [2024-10-11 04:26:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:45,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829445857] [2024-10-11 04:26:45,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:45,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:45,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:45,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:45,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:45,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:45,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:45,899 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:26:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:45,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829445857] [2024-10-11 04:26:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829445857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:45,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:26:45,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:26:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924627895] [2024-10-11 04:26:45,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:45,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:26:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:45,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:26:45,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:26:45,901 INFO L87 Difference]: Start difference. First operand 6209 states and 10303 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:26:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:47,275 INFO L93 Difference]: Finished difference Result 13635 states and 21859 transitions. [2024-10-11 04:26:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:26:47,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2024-10-11 04:26:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:47,314 INFO L225 Difference]: With dead ends: 13635 [2024-10-11 04:26:47,315 INFO L226 Difference]: Without dead ends: 9557 [2024-10-11 04:26:47,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:26:47,334 INFO L432 NwaCegarLoop]: 4189 mSDtfsCounter, 4620 mSDsluCounter, 12266 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 16455 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:47,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 16455 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:26:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9557 states. [2024-10-11 04:26:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9557 to 8223. [2024-10-11 04:26:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 7329 states have (on average 1.6159094010096875) internal successors, (11843), 7397 states have internal predecessors, (11843), 544 states have call successors, (544), 301 states have call predecessors, (544), 348 states have return successors, (899), 556 states have call predecessors, (899), 542 states have call successors, (899) [2024-10-11 04:26:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 13286 transitions. [2024-10-11 04:26:48,012 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 13286 transitions. Word has length 72 [2024-10-11 04:26:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:48,012 INFO L471 AbstractCegarLoop]: Abstraction has 8223 states and 13286 transitions. [2024-10-11 04:26:48,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:26:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 13286 transitions. [2024-10-11 04:26:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 04:26:48,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:48,030 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:26:48,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:26:48,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:48,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:48,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1971442477, now seen corresponding path program 1 times [2024-10-11 04:26:48,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:48,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927996228] [2024-10-11 04:26:48,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:48,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:26:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:26:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:26:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:26:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:48,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927996228] [2024-10-11 04:26:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927996228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:26:48,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016833445] [2024-10-11 04:26:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:48,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:26:48,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:26:48,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:26:48,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:26:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:48,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:26:48,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:26:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 04:26:48,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:26:48,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016833445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:48,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:26:48,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:26:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713953308] [2024-10-11 04:26:48,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:48,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:26:48,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:48,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:26:48,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:48,425 INFO L87 Difference]: Start difference. First operand 8223 states and 13286 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:26:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:49,276 INFO L93 Difference]: Finished difference Result 20254 states and 31860 transitions. [2024-10-11 04:26:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:26:49,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-10-11 04:26:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:49,340 INFO L225 Difference]: With dead ends: 20254 [2024-10-11 04:26:49,340 INFO L226 Difference]: Without dead ends: 14162 [2024-10-11 04:26:49,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:49,366 INFO L432 NwaCegarLoop]: 4161 mSDtfsCounter, 4134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:49,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 4346 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:26:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14162 states. [2024-10-11 04:26:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14162 to 14108. [2024-10-11 04:26:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14108 states, 12354 states have (on average 1.5695321353407803) internal successors, (19390), 12487 states have internal predecessors, (19390), 1056 states have call successors, (1056), 601 states have call predecessors, (1056), 696 states have return successors, (1737), 1051 states have call predecessors, (1737), 1054 states have call successors, (1737) [2024-10-11 04:26:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 22183 transitions. [2024-10-11 04:26:50,145 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 22183 transitions. Word has length 116 [2024-10-11 04:26:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:50,146 INFO L471 AbstractCegarLoop]: Abstraction has 14108 states and 22183 transitions. [2024-10-11 04:26:50,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:26:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 22183 transitions. [2024-10-11 04:26:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 04:26:50,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:50,177 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:26:50,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:26:50,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:26:50,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:50,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -842546001, now seen corresponding path program 1 times [2024-10-11 04:26:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948706281] [2024-10-11 04:26:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:26:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:26:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:26:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:26:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948706281] [2024-10-11 04:26:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948706281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:26:50,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793923298] [2024-10-11 04:26:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:50,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:26:50,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:26:50,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:26:50,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:26:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:50,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:26:50,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:26:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 04:26:50,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:26:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793923298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:50,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:26:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:26:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316806160] [2024-10-11 04:26:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:50,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:26:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:50,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:26:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:50,714 INFO L87 Difference]: Start difference. First operand 14108 states and 22183 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:26:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:51,989 INFO L93 Difference]: Finished difference Result 37757 states and 58509 transitions. [2024-10-11 04:26:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:26:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-10-11 04:26:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:52,120 INFO L225 Difference]: With dead ends: 37757 [2024-10-11 04:26:52,121 INFO L226 Difference]: Without dead ends: 25780 [2024-10-11 04:26:52,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:52,177 INFO L432 NwaCegarLoop]: 4161 mSDtfsCounter, 4139 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4139 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:52,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4139 Valid, 4346 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:26:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25780 states. [2024-10-11 04:26:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25780 to 25676. [2024-10-11 04:26:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25676 states, 22228 states have (on average 1.5367104552816269) internal successors, (34158), 22491 states have internal predecessors, (34158), 2054 states have call successors, (2054), 1201 states have call predecessors, (2054), 1392 states have return successors, (3387), 2015 states have call predecessors, (3387), 2052 states have call successors, (3387) [2024-10-11 04:26:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25676 states to 25676 states and 39599 transitions. [2024-10-11 04:26:54,310 INFO L78 Accepts]: Start accepts. Automaton has 25676 states and 39599 transitions. Word has length 116 [2024-10-11 04:26:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:54,311 INFO L471 AbstractCegarLoop]: Abstraction has 25676 states and 39599 transitions. [2024-10-11 04:26:54,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:26:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 25676 states and 39599 transitions. [2024-10-11 04:26:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 04:26:54,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:54,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:26:54,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:26:54,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:26:54,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash -161057683, now seen corresponding path program 1 times [2024-10-11 04:26:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:54,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347791120] [2024-10-11 04:26:54,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:26:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:26:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:26:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:26:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:26:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:26:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:26:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:26:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:54,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347791120] [2024-10-11 04:26:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347791120] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:26:54,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465812084] [2024-10-11 04:26:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:54,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:26:54,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:26:54,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:26:54,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:26:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:54,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:26:54,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:26:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 04:26:54,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:26:54,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465812084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:54,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:26:54,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:26:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692341984] [2024-10-11 04:26:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:54,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:26:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:26:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:54,853 INFO L87 Difference]: Start difference. First operand 25676 states and 39599 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:26:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:57,046 INFO L93 Difference]: Finished difference Result 71415 states and 109971 transitions. [2024-10-11 04:26:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:26:57,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2024-10-11 04:26:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:26:57,313 INFO L225 Difference]: With dead ends: 71415 [2024-10-11 04:26:57,314 INFO L226 Difference]: Without dead ends: 47871 [2024-10-11 04:26:57,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:57,397 INFO L432 NwaCegarLoop]: 4338 mSDtfsCounter, 182 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 8500 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:26:57,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 8500 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:26:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47871 states. [2024-10-11 04:27:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47871 to 47871. [2024-10-11 04:27:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47871 states, 41116 states have (on average 1.5094123942017705) internal successors, (62061), 41572 states have internal predecessors, (62061), 3969 states have call successors, (3969), 2401 states have call predecessors, (3969), 2784 states have return successors, (7350), 3961 states have call predecessors, (7350), 3967 states have call successors, (7350) [2024-10-11 04:27:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47871 states to 47871 states and 73380 transitions. [2024-10-11 04:27:00,958 INFO L78 Accepts]: Start accepts. Automaton has 47871 states and 73380 transitions. Word has length 116 [2024-10-11 04:27:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:00,959 INFO L471 AbstractCegarLoop]: Abstraction has 47871 states and 73380 transitions. [2024-10-11 04:27:00,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:27:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 47871 states and 73380 transitions. [2024-10-11 04:27:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 04:27:01,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:01,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:27:01,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:27:01,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:27:01,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:01,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash 858256470, now seen corresponding path program 1 times [2024-10-11 04:27:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121375863] [2024-10-11 04:27:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:27:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:27:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:27:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:27:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:27:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:27:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:27:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:27:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 04:27:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 04:27:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121375863] [2024-10-11 04:27:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121375863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:27:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148548753] [2024-10-11 04:27:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:01,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:27:01,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:27:01,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:27:01,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:27:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:01,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:27:01,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:27:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 04:27:01,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:27:01,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148548753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:01,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:27:01,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:27:01,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748389145] [2024-10-11 04:27:01,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:01,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:27:01,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:01,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:27:01,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:01,941 INFO L87 Difference]: Start difference. First operand 47871 states and 73380 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:27:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:06,640 INFO L93 Difference]: Finished difference Result 137299 states and 210371 transitions. [2024-10-11 04:27:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:27:06,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 149 [2024-10-11 04:27:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:07,324 INFO L225 Difference]: With dead ends: 137299 [2024-10-11 04:27:07,324 INFO L226 Difference]: Without dead ends: 91565 [2024-10-11 04:27:07,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:07,496 INFO L432 NwaCegarLoop]: 4164 mSDtfsCounter, 4093 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4093 SdHoareTripleChecker+Valid, 4349 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:07,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4093 Valid, 4349 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:27:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91565 states. [2024-10-11 04:27:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91565 to 91161. [2024-10-11 04:27:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91161 states, 78354 states have (on average 1.4957628200219517) internal successors, (117199), 79262 states have internal predecessors, (117199), 7383 states have call successors, (7383), 4655 states have call predecessors, (7383), 5422 states have return successors, (13774), 7307 states have call predecessors, (13774), 7381 states have call successors, (13774) [2024-10-11 04:27:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91161 states to 91161 states and 138356 transitions. [2024-10-11 04:27:14,256 INFO L78 Accepts]: Start accepts. Automaton has 91161 states and 138356 transitions. Word has length 149 [2024-10-11 04:27:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:14,257 INFO L471 AbstractCegarLoop]: Abstraction has 91161 states and 138356 transitions. [2024-10-11 04:27:14,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:27:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 91161 states and 138356 transitions. [2024-10-11 04:27:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 04:27:14,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:14,533 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:27:14,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:27:14,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:27:14,735 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:14,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1665344232, now seen corresponding path program 1 times [2024-10-11 04:27:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:14,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633597325] [2024-10-11 04:27:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:27:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:27:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:27:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:27:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:27:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 04:27:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:27:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 04:27:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:27:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 04:27:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 04:27:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633597325] [2024-10-11 04:27:14,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633597325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:27:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017851067] [2024-10-11 04:27:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:14,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:27:14,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:27:14,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:27:14,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:27:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:15,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:27:15,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:27:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 04:27:15,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:27:15,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017851067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:15,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:27:15,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:27:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427751763] [2024-10-11 04:27:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:15,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:27:15,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:15,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:27:15,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:15,109 INFO L87 Difference]: Start difference. First operand 91161 states and 138356 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)