./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_label44+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.13.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ef6d9fd95a71cebdd37ca9ed44a21ae5d28bdad26eec5b7b5fe261fc1809e5a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:18:07,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:18:08,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:18:08,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:18:08,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:18:08,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:18:08,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:18:08,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:18:08,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:18:08,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:18:08,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:18:08,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:18:08,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:18:08,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:18:08,077 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:18:08,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:18:08,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:18:08,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:18:08,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:18:08,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:18:08,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:18:08,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:18:08,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:18:08,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:18:08,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:18:08,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:18:08,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:18:08,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:18:08,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:18:08,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:18:08,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:18:08,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:18:08,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:18:08,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:18:08,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:18:08,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:18:08,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:18:08,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:18:08,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:18:08,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:18:08,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:18:08,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:18:08,088 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ef6d9fd95a71cebdd37ca9ed44a21ae5d28bdad26eec5b7b5fe261fc1809e5a [2024-10-24 02:18:08,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:18:08,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:18:08,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:18:08,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:18:08,344 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:18:08,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.13.cil-2.c [2024-10-24 02:18:09,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:18:10,489 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:18:10,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.13.cil-2.c [2024-10-24 02:18:10,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6db3d66/3efcf6078a0648b89bec5ca3ddaa1fab/FLAGb44be4d19 [2024-10-24 02:18:10,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6db3d66/3efcf6078a0648b89bec5ca3ddaa1fab [2024-10-24 02:18:10,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:18:10,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:18:10,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:18:10,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:18:10,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:18:10,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:18:10" (1/1) ... [2024-10-24 02:18:10,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ad6731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:10, skipping insertion in model container [2024-10-24 02:18:10,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:18:10" (1/1) ... [2024-10-24 02:18:10,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:18:12,405 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_label44+token_ring.13.cil-2.c[377340,377353] [2024-10-24 02:18:12,432 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_label44+token_ring.13.cil-2.c[383339,383352] [2024-10-24 02:18:12,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:18:12,703 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:18:13,483 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_label44+token_ring.13.cil-2.c[377340,377353] [2024-10-24 02:18:13,495 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_label44+token_ring.13.cil-2.c[383339,383352] [2024-10-24 02:18:13,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:18:13,640 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:18:13,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13 WrapperNode [2024-10-24 02:18:13,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:18:13,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:18:13,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:18:13,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:18:13,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:13,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:13,994 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13293 [2024-10-24 02:18:13,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:18:13,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:18:13,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:18:13,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:18:14,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,188 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-24 02:18:14,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:18:14,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:18:14,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:18:14,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:18:14,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (1/1) ... [2024-10-24 02:18:14,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:18:14,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:18:14,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 02:18:14,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 02:18:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:18:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 02:18:14,691 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 02:18:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 02:18:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 02:18:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 02:18:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 02:18:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 02:18:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 02:18:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 02:18:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 02:18:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 02:18:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 02:18:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:18:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:18:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:18:14,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:18:14,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:18:22,307 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2024-10-24 02:18:22,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:18:22,447 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:18:22,447 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-24 02:18:22,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:18:22 BoogieIcfgContainer [2024-10-24 02:18:22,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:18:22,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:18:22,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:18:22,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:18:22,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:18:10" (1/3) ... [2024-10-24 02:18:22,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b94a42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:18:22, skipping insertion in model container [2024-10-24 02:18:22,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:18:13" (2/3) ... [2024-10-24 02:18:22,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b94a42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:18:22, skipping insertion in model container [2024-10-24 02:18:22,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:18:22" (3/3) ... [2024-10-24 02:18:22,465 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.13.cil-2.c [2024-10-24 02:18:22,498 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:18:22,502 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:18:22,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:18:22,651 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;@788e910c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:18:22,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:18:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 02:18:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:22,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:22,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:22,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1072822453, now seen corresponding path program 1 times [2024-10-24 02:18:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:22,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562847373] [2024-10-24 02:18:22,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:23,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:23,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:23,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:23,432 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-24 02:18:23,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:23,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562847373] [2024-10-24 02:18:23,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562847373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:23,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:18:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460326359] [2024-10-24 02:18:23,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:23,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:18:23,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:23,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:18:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:18:23,502 INFO L87 Difference]: Start difference. First operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-24 02:18:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:25,401 INFO L93 Difference]: Finished difference Result 5122 states and 9562 transitions. [2024-10-24 02:18:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:18:25,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:25,423 INFO L225 Difference]: With dead ends: 5122 [2024-10-24 02:18:25,424 INFO L226 Difference]: Without dead ends: 2630 [2024-10-24 02:18:25,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:18:25,434 INFO L432 NwaCegarLoop]: 4276 mSDtfsCounter, 1048 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 16502 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:25,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 16502 Invalid, 1206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 02:18:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-24 02:18:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-24 02:18:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.8354378818737271) internal successors, (4506), 2457 states have internal predecessors, (4506), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 02:18:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4560 transitions. [2024-10-24 02:18:25,690 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4560 transitions. Word has length 171 [2024-10-24 02:18:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:25,690 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4560 transitions. [2024-10-24 02:18:25,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-24 02:18:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4560 transitions. [2024-10-24 02:18:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:25,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:25,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:25,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:18:25,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:25,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:25,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1643094259, now seen corresponding path program 1 times [2024-10-24 02:18:25,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:25,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888062440] [2024-10-24 02:18:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:25,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:25,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:25,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:25,936 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-24 02:18:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888062440] [2024-10-24 02:18:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888062440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:25,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:25,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:18:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675312531] [2024-10-24 02:18:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:25,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:18:25,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:18:25,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:18:25,942 INFO L87 Difference]: Start difference. First operand 2490 states and 4560 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-24 02:18:27,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:27,598 INFO L93 Difference]: Finished difference Result 2984 states and 5386 transitions. [2024-10-24 02:18:27,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:18:27,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:27,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:27,608 INFO L225 Difference]: With dead ends: 2984 [2024-10-24 02:18:27,609 INFO L226 Difference]: Without dead ends: 2630 [2024-10-24 02:18:27,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:18:27,612 INFO L432 NwaCegarLoop]: 4272 mSDtfsCounter, 1036 mSDsluCounter, 12217 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 16489 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:27,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 16489 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 02:18:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-24 02:18:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-24 02:18:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.835030549898167) internal successors, (4505), 2457 states have internal predecessors, (4505), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 02:18:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4559 transitions. [2024-10-24 02:18:27,665 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4559 transitions. Word has length 171 [2024-10-24 02:18:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:27,665 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4559 transitions. [2024-10-24 02:18:27,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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-24 02:18:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4559 transitions. [2024-10-24 02:18:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:27,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:27,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:27,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:18:27,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:27,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1031825201, now seen corresponding path program 1 times [2024-10-24 02:18:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:27,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783159925] [2024-10-24 02:18:27,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:27,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:27,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:27,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:28,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:28,006 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-24 02:18:28,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783159925] [2024-10-24 02:18:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783159925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:28,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:28,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 02:18:28,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604107834] [2024-10-24 02:18:28,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:28,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 02:18:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 02:18:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:18:28,015 INFO L87 Difference]: Start difference. First operand 2490 states and 4559 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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-24 02:18:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:31,283 INFO L93 Difference]: Finished difference Result 3491 states and 6239 transitions. [2024-10-24 02:18:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 02:18:31,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:31,294 INFO L225 Difference]: With dead ends: 3491 [2024-10-24 02:18:31,295 INFO L226 Difference]: Without dead ends: 3141 [2024-10-24 02:18:31,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:18:31,298 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 5542 mSDsluCounter, 12708 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 16946 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:31,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 16946 Invalid, 2578 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 02:18:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-10-24 02:18:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2862. [2024-10-24 02:18:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2798 states have (on average 1.812723373838456) internal successors, (5072), 2801 states have internal predecessors, (5072), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-24 02:18:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 5173 transitions. [2024-10-24 02:18:31,374 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 5173 transitions. Word has length 171 [2024-10-24 02:18:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:31,375 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 5173 transitions. [2024-10-24 02:18:31,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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-24 02:18:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 5173 transitions. [2024-10-24 02:18:31,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:31,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:31,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:31,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:18:31,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:31,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 247523539, now seen corresponding path program 1 times [2024-10-24 02:18:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367331418] [2024-10-24 02:18:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:31,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:31,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:31,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:31,720 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-24 02:18:31,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:31,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367331418] [2024-10-24 02:18:31,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367331418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:31,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:31,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:18:31,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199673940] [2024-10-24 02:18:31,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:31,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:18:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:18:31,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:18:31,730 INFO L87 Difference]: Start difference. First operand 2862 states and 5173 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:36,552 INFO L93 Difference]: Finished difference Result 4396 states and 7749 transitions. [2024-10-24 02:18:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:18:36,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:36,570 INFO L225 Difference]: With dead ends: 4396 [2024-10-24 02:18:36,570 INFO L226 Difference]: Without dead ends: 3674 [2024-10-24 02:18:36,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:18:36,576 INFO L432 NwaCegarLoop]: 4449 mSDtfsCounter, 5591 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3997 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5611 SdHoareTripleChecker+Valid, 21912 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:36,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5611 Valid, 21912 Invalid, 4060 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3997 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-24 02:18:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2024-10-24 02:18:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3205. [2024-10-24 02:18:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7933804627249357) internal successors, (5581), 3116 states have internal predecessors, (5581), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-24 02:18:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5728 transitions. [2024-10-24 02:18:36,730 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5728 transitions. Word has length 171 [2024-10-24 02:18:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:36,731 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5728 transitions. [2024-10-24 02:18:36,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5728 transitions. [2024-10-24 02:18:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:36,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:18:36,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:18:36,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash -17123951, now seen corresponding path program 1 times [2024-10-24 02:18:36,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:36,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389019945] [2024-10-24 02:18:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:37,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:37,267 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-24 02:18:37,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389019945] [2024-10-24 02:18:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389019945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:37,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:37,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:18:37,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94140398] [2024-10-24 02:18:37,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:37,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:18:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:37,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:18:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:18:37,274 INFO L87 Difference]: Start difference. First operand 3205 states and 5728 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:39,701 INFO L93 Difference]: Finished difference Result 4759 states and 8350 transitions. [2024-10-24 02:18:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:18:39,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:39,712 INFO L225 Difference]: With dead ends: 4759 [2024-10-24 02:18:39,712 INFO L226 Difference]: Without dead ends: 3694 [2024-10-24 02:18:39,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:18:39,715 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5115 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5136 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:39,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5136 Valid, 20880 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 02:18:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2024-10-24 02:18:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3205. [2024-10-24 02:18:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7924164524421593) internal successors, (5578), 3116 states have internal predecessors, (5578), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-24 02:18:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5725 transitions. [2024-10-24 02:18:39,791 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5725 transitions. Word has length 171 [2024-10-24 02:18:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:39,791 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5725 transitions. [2024-10-24 02:18:39,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5725 transitions. [2024-10-24 02:18:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:39,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:39,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:39,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:18:39,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:39,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1340302897, now seen corresponding path program 1 times [2024-10-24 02:18:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:39,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146492040] [2024-10-24 02:18:39,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:39,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:39,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:39,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:39,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:40,002 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-24 02:18:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146492040] [2024-10-24 02:18:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146492040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:40,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:40,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:18:40,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844495733] [2024-10-24 02:18:40,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:40,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:18:40,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:40,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:18:40,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:18:40,005 INFO L87 Difference]: Start difference. First operand 3205 states and 5725 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:41,913 INFO L93 Difference]: Finished difference Result 4755 states and 8333 transitions. [2024-10-24 02:18:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:18:41,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:41,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:41,924 INFO L225 Difference]: With dead ends: 4755 [2024-10-24 02:18:41,924 INFO L226 Difference]: Without dead ends: 3690 [2024-10-24 02:18:41,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:18:41,928 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5276 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5297 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:41,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5297 Valid, 16750 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 02:18:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2024-10-24 02:18:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3205. [2024-10-24 02:18:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.791452442159383) internal successors, (5575), 3116 states have internal predecessors, (5575), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-24 02:18:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5722 transitions. [2024-10-24 02:18:42,013 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5722 transitions. Word has length 171 [2024-10-24 02:18:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:42,014 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5722 transitions. [2024-10-24 02:18:42,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5722 transitions. [2024-10-24 02:18:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:42,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:42,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:42,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 02:18:42,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:42,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:42,016 INFO L85 PathProgramCache]: Analyzing trace with hash 556676561, now seen corresponding path program 1 times [2024-10-24 02:18:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:42,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260930351] [2024-10-24 02:18:42,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:42,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:42,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:42,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:42,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:42,268 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-24 02:18:42,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:42,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260930351] [2024-10-24 02:18:42,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260930351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:42,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:42,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:18:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126431159] [2024-10-24 02:18:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:18:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:18:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:18:42,270 INFO L87 Difference]: Start difference. First operand 3205 states and 5722 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:44,263 INFO L93 Difference]: Finished difference Result 4751 states and 8316 transitions. [2024-10-24 02:18:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:18:44,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:44,278 INFO L225 Difference]: With dead ends: 4751 [2024-10-24 02:18:44,278 INFO L226 Difference]: Without dead ends: 3686 [2024-10-24 02:18:44,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:18:44,282 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5274 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5295 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:44,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5295 Valid, 16750 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 02:18:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2024-10-24 02:18:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3205. [2024-10-24 02:18:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7904884318766068) internal successors, (5572), 3116 states have internal predecessors, (5572), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-24 02:18:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5719 transitions. [2024-10-24 02:18:44,391 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5719 transitions. Word has length 171 [2024-10-24 02:18:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:44,391 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5719 transitions. [2024-10-24 02:18:44,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5719 transitions. [2024-10-24 02:18:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:44,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:44,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:44,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 02:18:44,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:44,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash 894964111, now seen corresponding path program 1 times [2024-10-24 02:18:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:44,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375162987] [2024-10-24 02:18:44,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:44,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:44,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:44,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:44,791 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-24 02:18:44,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375162987] [2024-10-24 02:18:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375162987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:18:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648596628] [2024-10-24 02:18:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:44,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:18:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:44,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:18:44,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:18:44,794 INFO L87 Difference]: Start difference. First operand 3205 states and 5719 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:49,345 INFO L93 Difference]: Finished difference Result 5709 states and 9880 transitions. [2024-10-24 02:18:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:18:49,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:49,385 INFO L225 Difference]: With dead ends: 5709 [2024-10-24 02:18:49,386 INFO L226 Difference]: Without dead ends: 4644 [2024-10-24 02:18:49,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:18:49,396 INFO L432 NwaCegarLoop]: 4247 mSDtfsCounter, 5674 mSDsluCounter, 16920 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5694 SdHoareTripleChecker+Valid, 21167 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:49,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5694 Valid, 21167 Invalid, 3358 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [103 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 02:18:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4644 states. [2024-10-24 02:18:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4644 to 3904. [2024-10-24 02:18:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7593924860111911) internal successors, (6603), 3759 states have internal predecessors, (6603), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-24 02:18:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6846 transitions. [2024-10-24 02:18:49,629 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6846 transitions. Word has length 171 [2024-10-24 02:18:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:49,632 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6846 transitions. [2024-10-24 02:18:49,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6846 transitions. [2024-10-24 02:18:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:49,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:49,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:49,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 02:18:49,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:49,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1321518609, now seen corresponding path program 1 times [2024-10-24 02:18:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:49,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100320618] [2024-10-24 02:18:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:49,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:50,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:50,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:50,074 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-24 02:18:50,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:50,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100320618] [2024-10-24 02:18:50,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100320618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:50,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:50,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:18:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583729947] [2024-10-24 02:18:50,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:50,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:18:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:18:50,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:18:50,078 INFO L87 Difference]: Start difference. First operand 3904 states and 6846 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:52,114 INFO L93 Difference]: Finished difference Result 6395 states and 10995 transitions. [2024-10-24 02:18:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:18:52,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:52,132 INFO L225 Difference]: With dead ends: 6395 [2024-10-24 02:18:52,132 INFO L226 Difference]: Without dead ends: 4631 [2024-10-24 02:18:52,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:18:52,138 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5273 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5294 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:52,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 16750 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 02:18:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-24 02:18:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3904. [2024-10-24 02:18:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7580602184918732) internal successors, (6598), 3759 states have internal predecessors, (6598), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-24 02:18:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6841 transitions. [2024-10-24 02:18:52,258 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6841 transitions. Word has length 171 [2024-10-24 02:18:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:52,259 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6841 transitions. [2024-10-24 02:18:52,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6841 transitions. [2024-10-24 02:18:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:52,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:52,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:52,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 02:18:52,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:52,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash 781089103, now seen corresponding path program 1 times [2024-10-24 02:18:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:52,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848559835] [2024-10-24 02:18:52,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:52,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:52,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:52,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:52,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-24 02:18:52,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848559835] [2024-10-24 02:18:52,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848559835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:52,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:52,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:18:52,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339418269] [2024-10-24 02:18:52,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:52,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:18:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:52,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:18:52,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:18:52,636 INFO L87 Difference]: Start difference. First operand 3904 states and 6841 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:18:57,305 INFO L93 Difference]: Finished difference Result 8250 states and 14007 transitions. [2024-10-24 02:18:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:18:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:18:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:18:57,337 INFO L225 Difference]: With dead ends: 8250 [2024-10-24 02:18:57,338 INFO L226 Difference]: Without dead ends: 6486 [2024-10-24 02:18:57,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:18:57,348 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5556 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5576 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:18:57,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5576 Valid, 21910 Invalid, 3928 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 02:18:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2024-10-24 02:18:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5302. [2024-10-24 02:18:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5302 states, 5035 states have (on average 1.717974180734856) internal successors, (8650), 5045 states have internal predecessors, (8650), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-24 02:18:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 9091 transitions. [2024-10-24 02:18:57,629 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 9091 transitions. Word has length 171 [2024-10-24 02:18:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:18:57,630 INFO L471 AbstractCegarLoop]: Abstraction has 5302 states and 9091 transitions. [2024-10-24 02:18:57,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:18:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 9091 transitions. [2024-10-24 02:18:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:18:57,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:18:57,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:18:57,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 02:18:57,634 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:18:57,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:18:57,635 INFO L85 PathProgramCache]: Analyzing trace with hash 625108561, now seen corresponding path program 1 times [2024-10-24 02:18:57,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:18:57,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279911324] [2024-10-24 02:18:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:18:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:18:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:18:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:57,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:18:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:18:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:57,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:18:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:57,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:18:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:18:57,924 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-24 02:18:57,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:18:57,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279911324] [2024-10-24 02:18:57,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279911324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:18:57,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:18:57,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:18:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192794261] [2024-10-24 02:18:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:18:57,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:18:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:18:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:18:57,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:18:57,927 INFO L87 Difference]: Start difference. First operand 5302 states and 9091 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:19:03,347 INFO L93 Difference]: Finished difference Result 13338 states and 22315 transitions. [2024-10-24 02:19:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:19:03,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:19:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:19:03,389 INFO L225 Difference]: With dead ends: 13338 [2024-10-24 02:19:03,389 INFO L226 Difference]: Without dead ends: 10176 [2024-10-24 02:19:03,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:19:03,408 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5561 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5581 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:19:03,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5581 Valid, 21910 Invalid, 3910 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-24 02:19:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10176 states. [2024-10-24 02:19:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10176 to 8103. [2024-10-24 02:19:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6780641767490794) internal successors, (12760), 7622 states have internal predecessors, (12760), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-24 02:19:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13615 transitions. [2024-10-24 02:19:04,079 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13615 transitions. Word has length 171 [2024-10-24 02:19:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:19:04,080 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13615 transitions. [2024-10-24 02:19:04,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13615 transitions. [2024-10-24 02:19:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:19:04,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:19:04,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:19:04,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 02:19:04,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:19:04,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:19:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1035718927, now seen corresponding path program 1 times [2024-10-24 02:19:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:19:04,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876281262] [2024-10-24 02:19:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:19:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:19:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:04,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:19:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:19:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:19:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:19:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:04,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:19:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:04,359 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-24 02:19:04,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:19:04,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876281262] [2024-10-24 02:19:04,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876281262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:19:04,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:19:04,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:19:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183481217] [2024-10-24 02:19:04,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:19:04,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:19:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:19:04,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:19:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:19:04,361 INFO L87 Difference]: Start difference. First operand 8103 states and 13615 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:19:06,513 INFO L93 Difference]: Finished difference Result 16213 states and 27056 transitions. [2024-10-24 02:19:06,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:19:06,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:19:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:19:06,543 INFO L225 Difference]: With dead ends: 16213 [2024-10-24 02:19:06,543 INFO L226 Difference]: Without dead ends: 10250 [2024-10-24 02:19:06,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:19:06,561 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5277 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5298 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:19:06,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5298 Valid, 16750 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 02:19:06,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10250 states. [2024-10-24 02:19:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10250 to 8103. [2024-10-24 02:19:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.675828511309837) internal successors, (12743), 7622 states have internal predecessors, (12743), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-24 02:19:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13598 transitions. [2024-10-24 02:19:06,899 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13598 transitions. Word has length 171 [2024-10-24 02:19:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:19:06,900 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13598 transitions. [2024-10-24 02:19:06,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13598 transitions. [2024-10-24 02:19:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:19:06,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:19:06,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:19:06,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 02:19:06,906 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:19:06,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:19:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1100164275, now seen corresponding path program 1 times [2024-10-24 02:19:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:19:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913008059] [2024-10-24 02:19:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:19:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:19:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:19:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:07,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:19:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:07,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:19:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:19:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:07,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:19:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:07,141 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-24 02:19:07,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:19:07,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913008059] [2024-10-24 02:19:07,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913008059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:19:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:19:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:19:07,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77979199] [2024-10-24 02:19:07,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:19:07,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:19:07,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:19:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:19:07,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:19:07,143 INFO L87 Difference]: Start difference. First operand 8103 states and 13598 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:19:10,212 INFO L93 Difference]: Finished difference Result 16195 states and 26969 transitions. [2024-10-24 02:19:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:19:10,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:19:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:19:10,251 INFO L225 Difference]: With dead ends: 16195 [2024-10-24 02:19:10,251 INFO L226 Difference]: Without dead ends: 10232 [2024-10-24 02:19:10,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:19:10,275 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5112 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5133 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:19:10,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5133 Valid, 20880 Invalid, 1991 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 02:19:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10232 states. [2024-10-24 02:19:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10232 to 8103. [2024-10-24 02:19:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6735928458705944) internal successors, (12726), 7622 states have internal predecessors, (12726), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-24 02:19:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13581 transitions. [2024-10-24 02:19:10,779 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13581 transitions. Word has length 171 [2024-10-24 02:19:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:19:10,779 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13581 transitions. [2024-10-24 02:19:10,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13581 transitions. [2024-10-24 02:19:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:19:10,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:19:10,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:19:10,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 02:19:10,788 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:19:10,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:19:10,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1030516401, now seen corresponding path program 1 times [2024-10-24 02:19:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:19:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157526358] [2024-10-24 02:19:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:19:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:19:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:10,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:19:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:10,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:19:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:11,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:19:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:11,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:19:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:19:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:11,085 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-24 02:19:11,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:19:11,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157526358] [2024-10-24 02:19:11,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157526358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:19:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:19:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:19:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406596431] [2024-10-24 02:19:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:19:11,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:19:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:19:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:19:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:19:11,087 INFO L87 Difference]: Start difference. First operand 8103 states and 13581 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:19:16,118 INFO L93 Difference]: Finished difference Result 23459 states and 38713 transitions. [2024-10-24 02:19:16,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:19:16,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:19:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:19:16,171 INFO L225 Difference]: With dead ends: 23459 [2024-10-24 02:19:16,171 INFO L226 Difference]: Without dead ends: 17496 [2024-10-24 02:19:16,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:19:16,193 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5542 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:19:16,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 21910 Invalid, 3833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 02:19:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17496 states. [2024-10-24 02:19:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17496 to 13771. [2024-10-24 02:19:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13771 states, 12808 states have (on average 1.6400687070580886) internal successors, (21006), 12842 states have internal predecessors, (21006), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-24 02:19:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13771 states to 13771 states and 22743 transitions. [2024-10-24 02:19:17,178 INFO L78 Accepts]: Start accepts. Automaton has 13771 states and 22743 transitions. Word has length 171 [2024-10-24 02:19:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:19:17,178 INFO L471 AbstractCegarLoop]: Abstraction has 13771 states and 22743 transitions. [2024-10-24 02:19:17,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 13771 states and 22743 transitions. [2024-10-24 02:19:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:19:17,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:19:17,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:19:17,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 02:19:17,186 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:19:17,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:19:17,186 INFO L85 PathProgramCache]: Analyzing trace with hash -612627699, now seen corresponding path program 1 times [2024-10-24 02:19:17,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:19:17,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089447218] [2024-10-24 02:19:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:19:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:19:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:17,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:19:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:17,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:19:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:19:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:19:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:19:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:17,437 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-24 02:19:17,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:19:17,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089447218] [2024-10-24 02:19:17,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089447218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:19:17,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:19:17,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:19:17,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817042592] [2024-10-24 02:19:17,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:19:17,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:19:17,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:19:17,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:19:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:19:17,439 INFO L87 Difference]: Start difference. First operand 13771 states and 22743 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:19:24,341 INFO L93 Difference]: Finished difference Result 49061 states and 80615 transitions. [2024-10-24 02:19:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:19:24,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-24 02:19:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:19:24,571 INFO L225 Difference]: With dead ends: 49061 [2024-10-24 02:19:24,571 INFO L226 Difference]: Without dead ends: 37430 [2024-10-24 02:19:24,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:19:24,658 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 6106 mSDsluCounter, 16918 mSDsCounter, 0 mSdLazyCounter, 3161 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6140 SdHoareTripleChecker+Valid, 21167 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:19:24,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6140 Valid, 21167 Invalid, 3267 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [106 Valid, 3161 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-24 02:19:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37430 states. [2024-10-24 02:19:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37430 to 25068. [2024-10-24 02:19:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25068 states, 23209 states have (on average 1.6186824076866733) internal successors, (37568), 23275 states have internal predecessors, (37568), 1403 states have call successors, (1403), 390 states have call predecessors, (1403), 454 states have return successors, (2196), 1466 states have call predecessors, (2196), 1403 states have call successors, (2196) [2024-10-24 02:19:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25068 states to 25068 states and 41167 transitions. [2024-10-24 02:19:27,306 INFO L78 Accepts]: Start accepts. Automaton has 25068 states and 41167 transitions. Word has length 171 [2024-10-24 02:19:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:19:27,310 INFO L471 AbstractCegarLoop]: Abstraction has 25068 states and 41167 transitions. [2024-10-24 02:19:27,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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-24 02:19:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 25068 states and 41167 transitions. [2024-10-24 02:19:27,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 02:19:27,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:19:27,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:19:27,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 02:19:27,343 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:19:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:19:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash 786325903, now seen corresponding path program 1 times [2024-10-24 02:19:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:19:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083464111] [2024-10-24 02:19:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:19:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:19:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:19:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:27,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 02:19:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 02:19:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 02:19:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:27,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 02:19:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:19:27,837 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-24 02:19:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:19:27,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083464111] [2024-10-24 02:19:27,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083464111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:19:27,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:19:27,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:19:27,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996877785] [2024-10-24 02:19:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:19:27,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:19:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:19:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:19:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:19:27,843 INFO L87 Difference]: Start difference. First operand 25068 states and 41167 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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)