./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9ef62c47abda8be3b48c3c090b2cfd60af093668e4aab452f52a0b386786ccc6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:53:48,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:53:48,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:53:48,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:53:48,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:53:48,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:53:48,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:53:48,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:53:48,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:53:48,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:53:48,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:53:48,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:53:48,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:53:48,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:53:48,240 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:53:48,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:53:48,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:53:48,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:53:48,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:53:48,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:53:48,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:53:48,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:53:48,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:53:48,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:53:48,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:53:48,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:53:48,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:53:48,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:53:48,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:53:48,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:53:48,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:53:48,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:53:48,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:53:48,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:53:48,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:53:48,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:53:48,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:53:48,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:53:48,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:53:48,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:53:48,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:53:48,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:53:48,248 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 9ef62c47abda8be3b48c3c090b2cfd60af093668e4aab452f52a0b386786ccc6 [2024-10-12 20:53:48,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:53:48,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:53:48,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:53:48,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:53:48,568 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:53:48,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c [2024-10-12 20:53:50,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:53:50,606 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:53:50,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c [2024-10-12 20:53:50,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffabcf2e/7ee4083533854c3d9c7ba54f48eb087a/FLAG98a88fa4c [2024-10-12 20:53:50,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffabcf2e/7ee4083533854c3d9c7ba54f48eb087a [2024-10-12 20:53:50,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:53:50,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:53:50,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:53:50,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:53:50,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:53:50,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:53:50" (1/1) ... [2024-10-12 20:53:50,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fd15af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:50, skipping insertion in model container [2024-10-12 20:53:50,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:53:50" (1/1) ... [2024-10-12 20:53:50,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:53:52,461 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c[378560,378573] [2024-10-12 20:53:52,489 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c[383339,383352] [2024-10-12 20:53:52,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:53:52,697 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:53:53,502 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c[378560,378573] [2024-10-12 20:53:53,509 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c[383339,383352] [2024-10-12 20:53:53,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:53:53,584 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:53:53,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53 WrapperNode [2024-10-12 20:53:53,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:53:53,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:53:53,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:53:53,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:53:53,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:53,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,066 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12699 [2024-10-12 20:53:54,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:53:54,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:53:54,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:53:54,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:53:54,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,396 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-12 20:53:54,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:53:54,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:53:54,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:53:54,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:53:54,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (1/1) ... [2024-10-12 20:53:54,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:53:54,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:53:54,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:53:54,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:53:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:53:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:53:55,021 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:53:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:53:55,024 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:53:55,024 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:53:55,024 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:53:55,024 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 20:53:55,025 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 20:53:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:53:55,025 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:53:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:53:55,025 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:53:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:53:55,025 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:53:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:53:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:53:55,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:53:55,233 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:53:55,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:54:03,150 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2024-10-12 20:54:03,150 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:54:03,269 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:54:03,270 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-12 20:54:03,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:54:03 BoogieIcfgContainer [2024-10-12 20:54:03,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:54:03,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:54:03,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:54:03,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:54:03,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:53:50" (1/3) ... [2024-10-12 20:54:03,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f21e31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:54:03, skipping insertion in model container [2024-10-12 20:54:03,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:53" (2/3) ... [2024-10-12 20:54:03,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f21e31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:54:03, skipping insertion in model container [2024-10-12 20:54:03,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:54:03" (3/3) ... [2024-10-12 20:54:03,281 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.03.cil-1.c [2024-10-12 20:54:03,299 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:54:03,300 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:54:03,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:54:03,442 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;@4f14ab35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:54:03,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:54:03,455 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-12 20:54:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:54:03,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:03,474 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-12 20:54:03,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:03,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2102361474, now seen corresponding path program 1 times [2024-10-12 20:54:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967753256] [2024-10-12 20:54:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:03,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:03,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,065 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-12 20:54:04,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:04,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967753256] [2024-10-12 20:54:04,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967753256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:04,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:54:04,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567592066] [2024-10-12 20:54:04,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:04,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:54:04,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:04,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:54:04,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:54:04,115 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-12 20:54:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:05,464 INFO L93 Difference]: Finished difference Result 4754 states and 8887 transitions. [2024-10-12 20:54:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:54:05,467 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-12 20:54:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:05,512 INFO L225 Difference]: With dead ends: 4754 [2024-10-12 20:54:05,513 INFO L226 Difference]: Without dead ends: 2485 [2024-10-12 20:54:05,524 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-12 20:54:05,527 INFO L432 NwaCegarLoop]: 4085 mSDtfsCounter, 4475 mSDsluCounter, 12233 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:05,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4485 Valid, 16318 Invalid, 877 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:54:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2024-10-12 20:54:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2404. [2024-10-12 20:54:05,675 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-12 20:54:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4397 transitions. [2024-10-12 20:54:05,688 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4397 transitions. Word has length 72 [2024-10-12 20:54:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:05,688 INFO L471 AbstractCegarLoop]: Abstraction has 2404 states and 4397 transitions. [2024-10-12 20:54:05,689 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-12 20:54:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4397 transitions. [2024-10-12 20:54:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:54:05,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:05,692 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-12 20:54:05,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:54:05,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:05,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1928742274, now seen corresponding path program 1 times [2024-10-12 20:54:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:05,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081054552] [2024-10-12 20:54:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:05,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:05,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:05,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081054552] [2024-10-12 20:54:05,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081054552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:05,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:05,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:05,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119200043] [2024-10-12 20:54:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:05,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:05,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:05,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:05,938 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-12 20:54:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:07,335 INFO L93 Difference]: Finished difference Result 2937 states and 5237 transitions. [2024-10-12 20:54:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:54:07,335 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-12 20:54:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:07,349 INFO L225 Difference]: With dead ends: 2937 [2024-10-12 20:54:07,349 INFO L226 Difference]: Without dead ends: 2663 [2024-10-12 20:54:07,352 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-12 20:54:07,353 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-12 20:54:07,354 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-12 20:54:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-12 20:54:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2532. [2024-10-12 20:54:07,422 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-12 20:54:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 4592 transitions. [2024-10-12 20:54:07,433 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 4592 transitions. Word has length 72 [2024-10-12 20:54:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:07,434 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 4592 transitions. [2024-10-12 20:54:07,434 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-12 20:54:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 4592 transitions. [2024-10-12 20:54:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:54:07,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:07,437 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-12 20:54:07,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:54:07,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:07,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1368042496, now seen corresponding path program 1 times [2024-10-12 20:54:07,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:07,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629365627] [2024-10-12 20:54:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:07,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:07,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:07,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:07,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:07,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:07,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:07,613 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-12 20:54:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629365627] [2024-10-12 20:54:07,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629365627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:07,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:07,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:07,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879892178] [2024-10-12 20:54:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:07,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:07,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:07,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:07,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:07,616 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-12 20:54:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:08,944 INFO L93 Difference]: Finished difference Result 3398 states and 5954 transitions. [2024-10-12 20:54:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:54:08,946 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-12 20:54:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:08,962 INFO L225 Difference]: With dead ends: 3398 [2024-10-12 20:54:08,963 INFO L226 Difference]: Without dead ends: 2996 [2024-10-12 20:54:08,966 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-12 20:54:08,968 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-12 20:54:08,968 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-12 20:54:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2024-10-12 20:54:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2789. [2024-10-12 20:54:09,156 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-12 20:54:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4987 transitions. [2024-10-12 20:54:09,170 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4987 transitions. Word has length 72 [2024-10-12 20:54:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:09,171 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4987 transitions. [2024-10-12 20:54:09,172 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-12 20:54:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4987 transitions. [2024-10-12 20:54:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:54:09,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:09,178 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-12 20:54:09,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:54:09,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:09,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -934313410, now seen corresponding path program 1 times [2024-10-12 20:54:09,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:09,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166330665] [2024-10-12 20:54:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:09,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:09,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:09,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:09,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:09,387 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-12 20:54:09,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166330665] [2024-10-12 20:54:09,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166330665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:09,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:09,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:09,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733755100] [2024-10-12 20:54:09,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:09,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:09,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:09,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:09,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:09,390 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-12 20:54:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:10,120 INFO L93 Difference]: Finished difference Result 3643 states and 6340 transitions. [2024-10-12 20:54:10,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:54:10,121 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-12 20:54:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:10,136 INFO L225 Difference]: With dead ends: 3643 [2024-10-12 20:54:10,137 INFO L226 Difference]: Without dead ends: 2984 [2024-10-12 20:54:10,141 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-12 20:54:10,142 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-12 20:54:10,142 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-12 20:54:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2024-10-12 20:54:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2789. [2024-10-12 20:54:10,253 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-12 20:54:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4982 transitions. [2024-10-12 20:54:10,265 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4982 transitions. Word has length 72 [2024-10-12 20:54:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:10,266 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4982 transitions. [2024-10-12 20:54:10,266 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-12 20:54:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4982 transitions. [2024-10-12 20:54:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:54:10,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:10,268 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-12 20:54:10,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:54:10,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:10,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash 326603840, now seen corresponding path program 1 times [2024-10-12 20:54:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:10,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114871068] [2024-10-12 20:54:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:10,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:10,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:10,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:10,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:10,459 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-12 20:54:10,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:10,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114871068] [2024-10-12 20:54:10,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114871068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:10,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:10,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544794874] [2024-10-12 20:54:10,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:10,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:10,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:10,467 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-12 20:54:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:11,924 INFO L93 Difference]: Finished difference Result 4456 states and 7571 transitions. [2024-10-12 20:54:11,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:11,926 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-12 20:54:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:11,945 INFO L225 Difference]: With dead ends: 4456 [2024-10-12 20:54:11,946 INFO L226 Difference]: Without dead ends: 3797 [2024-10-12 20:54:11,951 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-12 20:54:11,952 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, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:11,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4586 Valid, 20666 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:54:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2024-10-12 20:54:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3300. [2024-10-12 20:54:12,123 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-12 20:54:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5767 transitions. [2024-10-12 20:54:12,135 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5767 transitions. Word has length 72 [2024-10-12 20:54:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:12,136 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5767 transitions. [2024-10-12 20:54:12,136 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-12 20:54:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5767 transitions. [2024-10-12 20:54:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:54:12,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:12,140 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-12 20:54:12,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:54:12,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:12,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:12,141 INFO L85 PathProgramCache]: Analyzing trace with hash 367278590, now seen corresponding path program 1 times [2024-10-12 20:54:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:12,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993211664] [2024-10-12 20:54:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,348 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-12 20:54:12,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:12,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993211664] [2024-10-12 20:54:12,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993211664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:12,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:12,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:12,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146902006] [2024-10-12 20:54:12,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:12,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:12,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:12,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:12,353 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-12 20:54:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:13,799 INFO L93 Difference]: Finished difference Result 6297 states and 10420 transitions. [2024-10-12 20:54:13,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:13,799 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-12 20:54:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:13,825 INFO L225 Difference]: With dead ends: 6297 [2024-10-12 20:54:13,825 INFO L226 Difference]: Without dead ends: 5127 [2024-10-12 20:54:13,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:54:13,833 INFO L432 NwaCegarLoop]: 4168 mSDtfsCounter, 4474 mSDsluCounter, 16494 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:13,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 20662 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:54:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2024-10-12 20:54:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 4238. [2024-10-12 20:54:14,016 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-12 20:54:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 7203 transitions. [2024-10-12 20:54:14,029 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 7203 transitions. Word has length 72 [2024-10-12 20:54:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:14,029 INFO L471 AbstractCegarLoop]: Abstraction has 4238 states and 7203 transitions. [2024-10-12 20:54:14,029 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-12 20:54:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 7203 transitions. [2024-10-12 20:54:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:54:14,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:14,032 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-12 20:54:14,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:54:14,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:14,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1754064000, now seen corresponding path program 1 times [2024-10-12 20:54:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:14,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411170540] [2024-10-12 20:54:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,165 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-12 20:54:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411170540] [2024-10-12 20:54:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411170540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:14,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:14,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284696980] [2024-10-12 20:54:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:14,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:14,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:14,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:14,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:14,168 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-12 20:54:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:15,604 INFO L93 Difference]: Finished difference Result 9417 states and 15228 transitions. [2024-10-12 20:54:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:15,605 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-12 20:54:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:15,655 INFO L225 Difference]: With dead ends: 9417 [2024-10-12 20:54:15,655 INFO L226 Difference]: Without dead ends: 7309 [2024-10-12 20:54:15,667 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-12 20:54:15,668 INFO L432 NwaCegarLoop]: 4169 mSDtfsCounter, 4462 mSDsluCounter, 16497 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:15,668 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.8s Time] [2024-10-12 20:54:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2024-10-12 20:54:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 6209. [2024-10-12 20:54:16,062 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-12 20:54:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 10303 transitions. [2024-10-12 20:54:16,082 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 10303 transitions. Word has length 72 [2024-10-12 20:54:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:16,083 INFO L471 AbstractCegarLoop]: Abstraction has 6209 states and 10303 transitions. [2024-10-12 20:54:16,083 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-12 20:54:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 10303 transitions. [2024-10-12 20:54:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:54:16,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:16,088 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-12 20:54:16,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:54:16,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:16,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2097002622, now seen corresponding path program 1 times [2024-10-12 20:54:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:16,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784798727] [2024-10-12 20:54:16,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:16,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,192 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-12 20:54:16,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:16,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784798727] [2024-10-12 20:54:16,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784798727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:16,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:54:16,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344863096] [2024-10-12 20:54:16,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:16,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:54:16,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:16,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:54:16,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:54:16,199 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-12 20:54:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:17,429 INFO L93 Difference]: Finished difference Result 13635 states and 21859 transitions. [2024-10-12 20:54:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:54:17,430 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-12 20:54:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:17,458 INFO L225 Difference]: With dead ends: 13635 [2024-10-12 20:54:17,458 INFO L226 Difference]: Without dead ends: 9557 [2024-10-12 20:54:17,473 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-12 20:54:17,474 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-12 20:54:17,475 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-12 20:54:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9557 states. [2024-10-12 20:54:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9557 to 8223. [2024-10-12 20:54:17,875 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-12 20:54:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 13286 transitions. [2024-10-12 20:54:17,898 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 13286 transitions. Word has length 72 [2024-10-12 20:54:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:17,899 INFO L471 AbstractCegarLoop]: Abstraction has 8223 states and 13286 transitions. [2024-10-12 20:54:17,900 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-12 20:54:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 13286 transitions. [2024-10-12 20:54:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 20:54:17,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:17,914 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-12 20:54:17,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:54:17,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:17,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:17,916 INFO L85 PathProgramCache]: Analyzing trace with hash -454887285, now seen corresponding path program 1 times [2024-10-12 20:54:17,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:17,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824939089] [2024-10-12 20:54:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:17,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:54:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:54:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,057 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-12 20:54:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824939089] [2024-10-12 20:54:18,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824939089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942764611] [2024-10-12 20:54:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:18,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:18,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:54:18,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:54:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:18,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:18,272 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-12 20:54:18,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:18,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942764611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:18,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:54:18,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569697017] [2024-10-12 20:54:18,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:18,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:18,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:18,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:18,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:18,274 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-12 20:54:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:19,177 INFO L93 Difference]: Finished difference Result 20254 states and 31860 transitions. [2024-10-12 20:54:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:19,177 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-12 20:54:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:19,240 INFO L225 Difference]: With dead ends: 20254 [2024-10-12 20:54:19,240 INFO L226 Difference]: Without dead ends: 14162 [2024-10-12 20:54:19,266 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-12 20:54:19,268 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-12 20:54:19,268 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-12 20:54:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14162 states. [2024-10-12 20:54:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14162 to 14108. [2024-10-12 20:54:19,960 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-12 20:54:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 22183 transitions. [2024-10-12 20:54:20,007 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 22183 transitions. Word has length 116 [2024-10-12 20:54:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:20,008 INFO L471 AbstractCegarLoop]: Abstraction has 14108 states and 22183 transitions. [2024-10-12 20:54:20,008 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-12 20:54:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 22183 transitions. [2024-10-12 20:54:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 20:54:20,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:20,032 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-12 20:54:20,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:54:20,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:20,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:20,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1026091533, now seen corresponding path program 1 times [2024-10-12 20:54:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:20,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054772679] [2024-10-12 20:54:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:20,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:54:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:54:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,364 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-12 20:54:20,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054772679] [2024-10-12 20:54:20,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054772679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074688296] [2024-10-12 20:54:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:20,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:20,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:20,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:54:20,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:54:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:20,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:20,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:20,533 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-12 20:54:20,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074688296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:20,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:20,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:54:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690072369] [2024-10-12 20:54:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:20,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:20,538 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-12 20:54:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:21,809 INFO L93 Difference]: Finished difference Result 37757 states and 58509 transitions. [2024-10-12 20:54:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:21,810 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-12 20:54:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:21,909 INFO L225 Difference]: With dead ends: 37757 [2024-10-12 20:54:21,909 INFO L226 Difference]: Without dead ends: 25780 [2024-10-12 20:54:21,959 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-12 20:54:21,960 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:21,960 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.0s Time] [2024-10-12 20:54:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25780 states. [2024-10-12 20:54:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25780 to 25676. [2024-10-12 20:54:23,576 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-12 20:54:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25676 states to 25676 states and 39599 transitions. [2024-10-12 20:54:23,668 INFO L78 Accepts]: Start accepts. Automaton has 25676 states and 39599 transitions. Word has length 116 [2024-10-12 20:54:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:23,669 INFO L471 AbstractCegarLoop]: Abstraction has 25676 states and 39599 transitions. [2024-10-12 20:54:23,669 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-12 20:54:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 25676 states and 39599 transitions. [2024-10-12 20:54:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 20:54:23,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:23,712 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-12 20:54:23,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 20:54:23,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 20:54:23,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:23,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1707579851, now seen corresponding path program 1 times [2024-10-12 20:54:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:23,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145475557] [2024-10-12 20:54:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:54:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:54:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,038 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-12 20:54:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145475557] [2024-10-12 20:54:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145475557] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85652638] [2024-10-12 20:54:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:24,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:24,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:24,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:54:24,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:54:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:24,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:24,177 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-12 20:54:24,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85652638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:24,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:24,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:54:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761716329] [2024-10-12 20:54:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:24,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:24,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:24,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:24,180 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-12 20:54:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:26,835 INFO L93 Difference]: Finished difference Result 71415 states and 109971 transitions. [2024-10-12 20:54:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:26,836 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-12 20:54:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:27,055 INFO L225 Difference]: With dead ends: 71415 [2024-10-12 20:54:27,056 INFO L226 Difference]: Without dead ends: 47871 [2024-10-12 20:54:27,132 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-12 20:54:27,133 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-12 20:54:27,133 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-12 20:54:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47871 states. [2024-10-12 20:54:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47871 to 47871. [2024-10-12 20:54:30,066 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-12 20:54:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47871 states to 47871 states and 73380 transitions. [2024-10-12 20:54:30,250 INFO L78 Accepts]: Start accepts. Automaton has 47871 states and 73380 transitions. Word has length 116 [2024-10-12 20:54:30,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:30,252 INFO L471 AbstractCegarLoop]: Abstraction has 47871 states and 73380 transitions. [2024-10-12 20:54:30,252 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-12 20:54:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47871 states and 73380 transitions. [2024-10-12 20:54:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 20:54:30,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:30,392 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-12 20:54:30,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 20:54:30,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:30,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:30,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash 508947190, now seen corresponding path program 1 times [2024-10-12 20:54:30,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:30,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476910489] [2024-10-12 20:54:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:30,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:54:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:54:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-12 20:54:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,746 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-12 20:54:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476910489] [2024-10-12 20:54:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476910489] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235665828] [2024-10-12 20:54:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:30,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:30,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:30,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:54:30,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:54:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:30,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:30,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:31,025 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-12 20:54:31,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235665828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:31,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:31,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:54:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563287251] [2024-10-12 20:54:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:31,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:31,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:31,033 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-12 20:54:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:35,879 INFO L93 Difference]: Finished difference Result 137299 states and 210371 transitions. [2024-10-12 20:54:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:35,880 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-12 20:54:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:36,566 INFO L225 Difference]: With dead ends: 137299 [2024-10-12 20:54:36,567 INFO L226 Difference]: Without dead ends: 91565 [2024-10-12 20:54:36,707 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-12 20:54:36,708 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:36,708 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.0s Time] [2024-10-12 20:54:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91565 states. [2024-10-12 20:54:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91565 to 91161. [2024-10-12 20:54:41,998 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-12 20:54:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91161 states to 91161 states and 138356 transitions. [2024-10-12 20:54:42,512 INFO L78 Accepts]: Start accepts. Automaton has 91161 states and 138356 transitions. Word has length 149 [2024-10-12 20:54:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:42,512 INFO L471 AbstractCegarLoop]: Abstraction has 91161 states and 138356 transitions. [2024-10-12 20:54:42,513 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-12 20:54:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 91161 states and 138356 transitions. [2024-10-12 20:54:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-12 20:54:42,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:42,786 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-12 20:54:42,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 20:54:42,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:42,987 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:42,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2109099657, now seen corresponding path program 1 times [2024-10-12 20:54:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:42,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327580546] [2024-10-12 20:54:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:54:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:54:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:54:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:54:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:54:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:54:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 20:54:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:54:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,141 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-12 20:54:43,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:43,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327580546] [2024-10-12 20:54:43,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327580546] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:43,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260799042] [2024-10-12 20:54:43,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:43,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:43,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:54:43,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:54:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:43,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:43,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:43,372 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-12 20:54:43,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:43,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260799042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:43,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:43,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:54:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206970503] [2024-10-12 20:54:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:43,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:43,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:43,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:43,375 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)