./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_label47+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.06.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8321a367d25b54b23b2762d5ecbfeee51530317d33e488964270d878a9001f5b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:24:12,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:24:12,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:24:12,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:24:12,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:24:12,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:24:12,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:24:12,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:24:12,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:24:12,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:24:12,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:24:12,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:24:12,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:24:12,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:24:12,279 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:24:12,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:24:12,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:24:12,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:24:12,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:24:12,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:24:12,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:24:12,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:24:12,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:24:12,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:24:12,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:24:12,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:24:12,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:24:12,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:24:12,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:24:12,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:24:12,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:24:12,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:24:12,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:24:12,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:24:12,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:24:12,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:24:12,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:24:12,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:24:12,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:24:12,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:24:12,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:24:12,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:24:12,287 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8321a367d25b54b23b2762d5ecbfeee51530317d33e488964270d878a9001f5b [2024-10-11 04:24:12,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:24:12,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:24:12,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:24:12,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:24:12,487 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:24:12,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.06.cil-2.c [2024-10-11 04:24:13,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:24:14,170 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:24:14,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.06.cil-2.c [2024-10-11 04:24:14,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f7e0d2da3/3a5b6d1777dd4671b38b0c0c23545dc6/FLAG247747de2 [2024-10-11 04:24:14,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f7e0d2da3/3a5b6d1777dd4671b38b0c0c23545dc6 [2024-10-11 04:24:14,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:24:14,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:24:14,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:24:14,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:24:14,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:24:14,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:24:14" (1/1) ... [2024-10-11 04:24:14,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61439942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:14, skipping insertion in model container [2024-10-11 04:24:14,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:24:14" (1/1) ... [2024-10-11 04:24:14,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:24:15,623 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_label47+token_ring.06.cil-2.c[377612,377625] [2024-10-11 04:24:15,646 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_label47+token_ring.06.cil-2.c[383339,383352] [2024-10-11 04:24:15,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:24:15,806 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:24:16,399 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_label47+token_ring.06.cil-2.c[377612,377625] [2024-10-11 04:24:16,410 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_label47+token_ring.06.cil-2.c[383339,383352] [2024-10-11 04:24:16,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:24:16,464 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:24:16,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16 WrapperNode [2024-10-11 04:24:16,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:24:16,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:24:16,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:24:16,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:24:16,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:16,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:16,834 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12873 [2024-10-11 04:24:16,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:24:16,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:24:16,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:24:16,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:24:16,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:16,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:16,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:17,033 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:24:17,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:17,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:17,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:17,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:17,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:17,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:17,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:24:17,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:24:17,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:24:17,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:24:17,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (1/1) ... [2024-10-11 04:24:17,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:24:17,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:17,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:24:17,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:24:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:24:17,397 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:24:17,397 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:24:17,397 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:24:17,398 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:24:17,398 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:24:17,398 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:24:17,399 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:24:17,399 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:24:17,399 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:24:17,399 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:24:17,399 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:24:17,399 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:24:17,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:24:17,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:24:17,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:24:17,485 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:24:17,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:24:23,447 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2024-10-11 04:24:23,447 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:24:23,526 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:24:23,526 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 04:24:23,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:24:23 BoogieIcfgContainer [2024-10-11 04:24:23,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:24:23,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:24:23,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:24:23,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:24:23,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:24:14" (1/3) ... [2024-10-11 04:24:23,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6e79b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:24:23, skipping insertion in model container [2024-10-11 04:24:23,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:16" (2/3) ... [2024-10-11 04:24:23,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6e79b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:24:23, skipping insertion in model container [2024-10-11 04:24:23,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:24:23" (3/3) ... [2024-10-11 04:24:23,532 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.06.cil-2.c [2024-10-11 04:24:23,544 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:24:23,544 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:24:23,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:24:23,645 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;@64048262, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:24:23,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:24:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 2333 states, 2304 states have (on average 1.8815104166666667) internal successors, (4335), 2307 states have internal predecessors, (4335), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 04:24:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:23,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:23,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:23,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:23,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1188096418, now seen corresponding path program 1 times [2024-10-11 04:24:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346948377] [2024-10-11 04:24:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346948377] [2024-10-11 04:24:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346948377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:24,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:24,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:24:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451043272] [2024-10-11 04:24:24,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:24,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:24:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:24,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:24:24,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:24:24,314 INFO L87 Difference]: Start difference. First operand has 2333 states, 2304 states have (on average 1.8815104166666667) internal successors, (4335), 2307 states have internal predecessors, (4335), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:25,210 INFO L93 Difference]: Finished difference Result 4728 states and 8858 transitions. [2024-10-11 04:24:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:24:25,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:25,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:25,240 INFO L225 Difference]: With dead ends: 4728 [2024-10-11 04:24:25,241 INFO L226 Difference]: Without dead ends: 2399 [2024-10-11 04:24:25,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:24:25,254 INFO L432 NwaCegarLoop]: 4143 mSDtfsCounter, 553 mSDsluCounter, 12072 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 16215 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:25,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 16215 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:24:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-11 04:24:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2329. [2024-10-11 04:24:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2301 states have (on average 1.8457192524989134) internal successors, (4247), 2303 states have internal predecessors, (4247), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 04:24:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4287 transitions. [2024-10-11 04:24:25,360 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4287 transitions. Word has length 101 [2024-10-11 04:24:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:25,360 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4287 transitions. [2024-10-11 04:24:25,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4287 transitions. [2024-10-11 04:24:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:25,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:25,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:25,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:24:25,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:25,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1229807648, now seen corresponding path program 1 times [2024-10-11 04:24:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:25,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116422285] [2024-10-11 04:24:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:25,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:25,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:25,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116422285] [2024-10-11 04:24:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116422285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:25,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625672069] [2024-10-11 04:24:25,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:25,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:25,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:25,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:25,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:25,622 INFO L87 Difference]: Start difference. First operand 2329 states and 4287 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:27,692 INFO L93 Difference]: Finished difference Result 2881 states and 5198 transitions. [2024-10-11 04:24:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:27,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:27,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:27,702 INFO L225 Difference]: With dead ends: 2881 [2024-10-11 04:24:27,702 INFO L226 Difference]: Without dead ends: 2685 [2024-10-11 04:24:27,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:24:27,704 INFO L432 NwaCegarLoop]: 4241 mSDtfsCounter, 4743 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4756 SdHoareTripleChecker+Valid, 20974 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:27,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4756 Valid, 20974 Invalid, 2226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:24:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2024-10-11 04:24:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2536. [2024-10-11 04:24:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2483 states have (on average 1.829238824003222) internal successors, (4542), 2487 states have internal predecessors, (4542), 37 states have call successors, (37), 12 states have call predecessors, (37), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2024-10-11 04:24:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4623 transitions. [2024-10-11 04:24:27,758 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4623 transitions. Word has length 101 [2024-10-11 04:24:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:27,758 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 4623 transitions. [2024-10-11 04:24:27,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4623 transitions. [2024-10-11 04:24:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:27,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:27,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:27,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:24:27,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:27,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1188676830, now seen corresponding path program 1 times [2024-10-11 04:24:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438654435] [2024-10-11 04:24:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:27,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:27,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438654435] [2024-10-11 04:24:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438654435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:27,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:27,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281145181] [2024-10-11 04:24:27,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:27,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:27,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:27,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:27,946 INFO L87 Difference]: Start difference. First operand 2536 states and 4623 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:29,485 INFO L93 Difference]: Finished difference Result 3580 states and 6330 transitions. [2024-10-11 04:24:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:29,500 INFO L225 Difference]: With dead ends: 3580 [2024-10-11 04:24:29,501 INFO L226 Difference]: Without dead ends: 3179 [2024-10-11 04:24:29,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:24:29,507 INFO L432 NwaCegarLoop]: 4202 mSDtfsCounter, 4768 mSDsluCounter, 16681 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4781 SdHoareTripleChecker+Valid, 20883 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:29,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4781 Valid, 20883 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:24:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-10-11 04:24:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2914. [2024-10-11 04:24:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.8008519701810437) internal successors, (5073), 2823 states have internal predecessors, (5073), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:24:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5224 transitions. [2024-10-11 04:24:29,605 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5224 transitions. Word has length 101 [2024-10-11 04:24:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:29,605 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5224 transitions. [2024-10-11 04:24:29,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5224 transitions. [2024-10-11 04:24:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:29,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:29,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:29,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:24:29,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:29,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:29,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1227159520, now seen corresponding path program 1 times [2024-10-11 04:24:29,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:29,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124697064] [2024-10-11 04:24:29,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:29,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:29,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:29,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:29,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124697064] [2024-10-11 04:24:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124697064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946959907] [2024-10-11 04:24:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:29,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:29,768 INFO L87 Difference]: Start difference. First operand 2914 states and 5224 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:30,700 INFO L93 Difference]: Finished difference Result 3965 states and 6956 transitions. [2024-10-11 04:24:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:24:30,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:30,712 INFO L225 Difference]: With dead ends: 3965 [2024-10-11 04:24:30,712 INFO L226 Difference]: Without dead ends: 3184 [2024-10-11 04:24:30,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:24:30,716 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4644 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4658 SdHoareTripleChecker+Valid, 16333 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:30,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4658 Valid, 16333 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:24:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2024-10-11 04:24:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2914. [2024-10-11 04:24:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.7990770323038694) internal successors, (5068), 2823 states have internal predecessors, (5068), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:24:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5219 transitions. [2024-10-11 04:24:30,823 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5219 transitions. Word has length 101 [2024-10-11 04:24:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:30,824 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5219 transitions. [2024-10-11 04:24:30,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5219 transitions. [2024-10-11 04:24:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:30,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:30,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:30,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:24:30,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1742951582, now seen corresponding path program 1 times [2024-10-11 04:24:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:30,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768907737] [2024-10-11 04:24:30,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:30,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:30,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:30,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:31,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:31,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768907737] [2024-10-11 04:24:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768907737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:31,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118657316] [2024-10-11 04:24:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:31,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:31,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:31,007 INFO L87 Difference]: Start difference. First operand 2914 states and 5219 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:31,813 INFO L93 Difference]: Finished difference Result 3961 states and 6935 transitions. [2024-10-11 04:24:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:24:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:31,826 INFO L225 Difference]: With dead ends: 3961 [2024-10-11 04:24:31,826 INFO L226 Difference]: Without dead ends: 3180 [2024-10-11 04:24:31,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:24:31,831 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4642 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4656 SdHoareTripleChecker+Valid, 16333 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:31,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4656 Valid, 16333 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:24:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2024-10-11 04:24:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2914. [2024-10-11 04:24:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.797302094426695) internal successors, (5063), 2823 states have internal predecessors, (5063), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:24:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5214 transitions. [2024-10-11 04:24:31,927 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5214 transitions. Word has length 101 [2024-10-11 04:24:31,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:31,927 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5214 transitions. [2024-10-11 04:24:31,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5214 transitions. [2024-10-11 04:24:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:31,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:31,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:31,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:24:31,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:31,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash -176193632, now seen corresponding path program 1 times [2024-10-11 04:24:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:31,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806461392] [2024-10-11 04:24:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:32,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:32,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:32,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:32,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806461392] [2024-10-11 04:24:32,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806461392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:32,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:32,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870180744] [2024-10-11 04:24:32,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:32,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:32,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:32,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:32,081 INFO L87 Difference]: Start difference. First operand 2914 states and 5214 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:32,916 INFO L93 Difference]: Finished difference Result 3956 states and 6912 transitions. [2024-10-11 04:24:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:24:32,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:32,927 INFO L225 Difference]: With dead ends: 3956 [2024-10-11 04:24:32,928 INFO L226 Difference]: Without dead ends: 3175 [2024-10-11 04:24:32,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:24:32,934 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4555 mSDsluCounter, 16280 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 20387 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:32,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 20387 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:24:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2024-10-11 04:24:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2914. [2024-10-11 04:24:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.7955271565495208) internal successors, (5058), 2823 states have internal predecessors, (5058), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:24:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5209 transitions. [2024-10-11 04:24:33,011 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5209 transitions. Word has length 101 [2024-10-11 04:24:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:33,011 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5209 transitions. [2024-10-11 04:24:33,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5209 transitions. [2024-10-11 04:24:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:33,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:33,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:33,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:24:33,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:33,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1234031710, now seen corresponding path program 1 times [2024-10-11 04:24:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:33,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575851528] [2024-10-11 04:24:33,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:33,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:33,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:33,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:33,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:33,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575851528] [2024-10-11 04:24:33,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575851528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:33,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:33,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207840480] [2024-10-11 04:24:33,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:33,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:33,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:33,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:33,152 INFO L87 Difference]: Start difference. First operand 2914 states and 5209 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:34,582 INFO L93 Difference]: Finished difference Result 4927 states and 8441 transitions. [2024-10-11 04:24:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:34,598 INFO L225 Difference]: With dead ends: 4927 [2024-10-11 04:24:34,598 INFO L226 Difference]: Without dead ends: 4148 [2024-10-11 04:24:34,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:24:34,601 INFO L432 NwaCegarLoop]: 4240 mSDtfsCounter, 4734 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4747 SdHoareTripleChecker+Valid, 20973 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:34,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4747 Valid, 20973 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:24:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2024-10-11 04:24:34,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 3681. [2024-10-11 04:24:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3496 states have (on average 1.7502860411899313) internal successors, (6119), 3506 states have internal predecessors, (6119), 127 states have call successors, (127), 48 states have call predecessors, (127), 56 states have return successors, (170), 134 states have call predecessors, (170), 127 states have call successors, (170) [2024-10-11 04:24:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6416 transitions. [2024-10-11 04:24:34,730 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6416 transitions. Word has length 101 [2024-10-11 04:24:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:34,730 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 6416 transitions. [2024-10-11 04:24:34,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6416 transitions. [2024-10-11 04:24:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:34,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:34,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:34,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:24:34,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:34,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1918433120, now seen corresponding path program 1 times [2024-10-11 04:24:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952720422] [2024-10-11 04:24:34,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952720422] [2024-10-11 04:24:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952720422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:34,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:34,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:34,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174210469] [2024-10-11 04:24:34,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:34,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:34,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:34,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:34,890 INFO L87 Difference]: Start difference. First operand 3681 states and 6416 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:36,773 INFO L93 Difference]: Finished difference Result 8286 states and 13806 transitions. [2024-10-11 04:24:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:24:36,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:36,805 INFO L225 Difference]: With dead ends: 8286 [2024-10-11 04:24:36,805 INFO L226 Difference]: Without dead ends: 6740 [2024-10-11 04:24:36,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:24:36,812 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4964 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4984 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:36,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4984 Valid, 20963 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:24:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2024-10-11 04:24:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 5206. [2024-10-11 04:24:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5206 states, 4853 states have (on average 1.6985369874304554) internal successors, (8243), 4871 states have internal predecessors, (8243), 239 states have call successors, (239), 96 states have call predecessors, (239), 112 states have return successors, (352), 254 states have call predecessors, (352), 239 states have call successors, (352) [2024-10-11 04:24:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 8834 transitions. [2024-10-11 04:24:37,109 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 8834 transitions. Word has length 101 [2024-10-11 04:24:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:37,110 INFO L471 AbstractCegarLoop]: Abstraction has 5206 states and 8834 transitions. [2024-10-11 04:24:37,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 8834 transitions. [2024-10-11 04:24:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:37,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:37,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:37,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:24:37,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:37,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2136294430, now seen corresponding path program 1 times [2024-10-11 04:24:37,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:37,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221095265] [2024-10-11 04:24:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:37,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:37,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:37,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:37,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:37,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221095265] [2024-10-11 04:24:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221095265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:37,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:37,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:37,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206826289] [2024-10-11 04:24:37,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:37,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:37,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:37,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:37,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:37,260 INFO L87 Difference]: Start difference. First operand 5206 states and 8834 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:38,896 INFO L93 Difference]: Finished difference Result 13949 states and 22916 transitions. [2024-10-11 04:24:38,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:24:38,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:38,928 INFO L225 Difference]: With dead ends: 13949 [2024-10-11 04:24:38,928 INFO L226 Difference]: Without dead ends: 10878 [2024-10-11 04:24:38,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:24:38,942 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 4907 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4927 SdHoareTripleChecker+Valid, 20965 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:38,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4927 Valid, 20965 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:24:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10878 states. [2024-10-11 04:24:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10878 to 8271. [2024-10-11 04:24:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8271 states, 7590 states have (on average 1.6517786561264822) internal successors, (12537), 7624 states have internal predecessors, (12537), 455 states have call successors, (455), 192 states have call predecessors, (455), 224 states have return successors, (762), 486 states have call predecessors, (762), 455 states have call successors, (762) [2024-10-11 04:24:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8271 states to 8271 states and 13754 transitions. [2024-10-11 04:24:39,277 INFO L78 Accepts]: Start accepts. Automaton has 8271 states and 13754 transitions. Word has length 101 [2024-10-11 04:24:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:39,278 INFO L471 AbstractCegarLoop]: Abstraction has 8271 states and 13754 transitions. [2024-10-11 04:24:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 8271 states and 13754 transitions. [2024-10-11 04:24:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:39,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:39,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:39,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:24:39,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2109228828, now seen corresponding path program 1 times [2024-10-11 04:24:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:39,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172525826] [2024-10-11 04:24:39,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:39,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:39,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:39,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:39,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172525826] [2024-10-11 04:24:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172525826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:39,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:39,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968954075] [2024-10-11 04:24:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:39,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:39,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:39,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:39,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:39,412 INFO L87 Difference]: Start difference. First operand 8271 states and 13754 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:41,476 INFO L93 Difference]: Finished difference Result 25224 states and 41230 transitions. [2024-10-11 04:24:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:24:41,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:41,547 INFO L225 Difference]: With dead ends: 25224 [2024-10-11 04:24:41,547 INFO L226 Difference]: Without dead ends: 19088 [2024-10-11 04:24:41,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:24:41,575 INFO L432 NwaCegarLoop]: 4204 mSDtfsCounter, 4884 mSDsluCounter, 16679 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 20883 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:41,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4904 Valid, 20883 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:24:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19088 states. [2024-10-11 04:24:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19088 to 14401. [2024-10-11 04:24:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14401 states, 13080 states have (on average 1.6175076452599388) internal successors, (21157), 13146 states have internal predecessors, (21157), 871 states have call successors, (871), 384 states have call predecessors, (871), 448 states have return successors, (1728), 934 states have call predecessors, (1728), 871 states have call successors, (1728) [2024-10-11 04:24:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14401 states to 14401 states and 23756 transitions. [2024-10-11 04:24:42,474 INFO L78 Accepts]: Start accepts. Automaton has 14401 states and 23756 transitions. Word has length 101 [2024-10-11 04:24:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:42,475 INFO L471 AbstractCegarLoop]: Abstraction has 14401 states and 23756 transitions. [2024-10-11 04:24:42,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 14401 states and 23756 transitions. [2024-10-11 04:24:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:42,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:42,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:42,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:24:42,485 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:42,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:42,486 INFO L85 PathProgramCache]: Analyzing trace with hash 108401570, now seen corresponding path program 1 times [2024-10-11 04:24:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:42,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120903002] [2024-10-11 04:24:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:42,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:42,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:42,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:42,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120903002] [2024-10-11 04:24:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120903002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:42,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:42,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998364999] [2024-10-11 04:24:42,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:42,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:42,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:42,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:42,636 INFO L87 Difference]: Start difference. First operand 14401 states and 23756 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:45,699 INFO L93 Difference]: Finished difference Result 47294 states and 77674 transitions. [2024-10-11 04:24:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:24:45,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:45,826 INFO L225 Difference]: With dead ends: 47294 [2024-10-11 04:24:45,827 INFO L226 Difference]: Without dead ends: 35028 [2024-10-11 04:24:45,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:24:45,871 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4775 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4787 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:45,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4787 Valid, 20963 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:24:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35028 states. [2024-10-11 04:24:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35028 to 26661. [2024-10-11 04:24:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26661 states, 24092 states have (on average 1.596422048812884) internal successors, (38461), 24222 states have internal predecessors, (38461), 1671 states have call successors, (1671), 768 states have call predecessors, (1671), 896 states have return successors, (4114), 1798 states have call predecessors, (4114), 1671 states have call successors, (4114) [2024-10-11 04:24:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26661 states to 26661 states and 44246 transitions. [2024-10-11 04:24:47,280 INFO L78 Accepts]: Start accepts. Automaton has 26661 states and 44246 transitions. Word has length 101 [2024-10-11 04:24:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:47,280 INFO L471 AbstractCegarLoop]: Abstraction has 26661 states and 44246 transitions. [2024-10-11 04:24:47,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 26661 states and 44246 transitions. [2024-10-11 04:24:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:47,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:47,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:47,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:24:47,297 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:47,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1842506020, now seen corresponding path program 1 times [2024-10-11 04:24:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674110918] [2024-10-11 04:24:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:47,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:47,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:47,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:47,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:47,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674110918] [2024-10-11 04:24:47,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674110918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:47,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:47,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20394220] [2024-10-11 04:24:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:47,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:47,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:47,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:47,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:47,418 INFO L87 Difference]: Start difference. First operand 26661 states and 44246 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:52,175 INFO L93 Difference]: Finished difference Result 90474 states and 150842 transitions. [2024-10-11 04:24:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:24:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:24:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:52,421 INFO L225 Difference]: With dead ends: 90474 [2024-10-11 04:24:52,422 INFO L226 Difference]: Without dead ends: 65948 [2024-10-11 04:24:52,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:24:52,490 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4805 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4825 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:52,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4825 Valid, 20963 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:24:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65948 states. [2024-10-11 04:24:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65948 to 51181. [2024-10-11 04:24:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51181 states, 46180 states have (on average 1.585036812472932) internal successors, (73197), 46438 states have internal predecessors, (73197), 3207 states have call successors, (3207), 1536 states have call predecessors, (3207), 1792 states have return successors, (10280), 3462 states have call predecessors, (10280), 3207 states have call successors, (10280) [2024-10-11 04:24:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51181 states to 51181 states and 86684 transitions. [2024-10-11 04:24:55,419 INFO L78 Accepts]: Start accepts. Automaton has 51181 states and 86684 transitions. Word has length 101 [2024-10-11 04:24:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:55,420 INFO L471 AbstractCegarLoop]: Abstraction has 51181 states and 86684 transitions. [2024-10-11 04:24:55,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:55,420 INFO L276 IsEmpty]: Start isEmpty. Operand 51181 states and 86684 transitions. [2024-10-11 04:24:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:24:55,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:55,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:55,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:24:55,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:55,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1565238430, now seen corresponding path program 1 times [2024-10-11 04:24:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420643684] [2024-10-11 04:24:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:24:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:24:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:24:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:24:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:24:55,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:55,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420643684] [2024-10-11 04:24:55,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420643684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:55,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:55,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:55,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023105680] [2024-10-11 04:24:55,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:55,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:55,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:55,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:55,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:55,576 INFO L87 Difference]: Start difference. First operand 51181 states and 86684 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:25:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:03,726 INFO L93 Difference]: Finished difference Result 174914 states and 299682 transitions. [2024-10-11 04:25:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:25:03,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-10-11 04:25:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:04,249 INFO L225 Difference]: With dead ends: 174914 [2024-10-11 04:25:04,250 INFO L226 Difference]: Without dead ends: 125868 [2024-10-11 04:25:04,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:25:04,389 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4756 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4768 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:04,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4768 Valid, 20963 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:25:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125868 states. [2024-10-11 04:25:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125868 to 100221. [2024-10-11 04:25:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100221 states, 90484 states have (on average 1.5795610273639538) internal successors, (142925), 90998 states have internal predecessors, (142925), 6151 states have call successors, (6151), 3072 states have call predecessors, (6151), 3584 states have return successors, (26858), 6662 states have call predecessors, (26858), 6151 states have call successors, (26858) [2024-10-11 04:25:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100221 states to 100221 states and 175934 transitions. [2024-10-11 04:25:11,605 INFO L78 Accepts]: Start accepts. Automaton has 100221 states and 175934 transitions. Word has length 101 [2024-10-11 04:25:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:11,606 INFO L471 AbstractCegarLoop]: Abstraction has 100221 states and 175934 transitions. [2024-10-11 04:25:11,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:25:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 100221 states and 175934 transitions. [2024-10-11 04:25:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:25:11,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:11,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:11,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:25:11,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 818686308, now seen corresponding path program 1 times [2024-10-11 04:25:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:11,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610195944] [2024-10-11 04:25:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:25:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:11,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:25:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:25:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:25:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:25:11,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:11,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610195944] [2024-10-11 04:25:11,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610195944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:11,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:11,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:25:11,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279219526] [2024-10-11 04:25:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:11,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:25:11,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:11,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:25:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:25:11,789 INFO L87 Difference]: Start difference. First operand 100221 states and 175934 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)