./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 858df747258432440d8be7960c85c9b1ad66b3a3b967b98ccb7c6efb60152481 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:36:34,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:36:34,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:36:34,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:36:34,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:36:34,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:36:34,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:36:34,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:36:34,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:36:34,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:36:34,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:36:34,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:36:34,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:36:34,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:36:34,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:36:34,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:36:34,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:36:34,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:36:34,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:36:34,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:36:34,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:36:34,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:36:34,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:36:34,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:36:34,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:36:34,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:36:34,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:36:34,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:36:34,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:36:34,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:36:34,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:36:34,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:36:34,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:36:34,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:36:34,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:36:34,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:36:34,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:36:34,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:36:34,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:36:34,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:36:34,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:36:34,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:36:34,842 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 -> 858df747258432440d8be7960c85c9b1ad66b3a3b967b98ccb7c6efb60152481 [2024-11-08 16:36:35,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:36:35,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:36:35,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:36:35,154 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:36:35,155 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:36:35,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-1.c [2024-11-08 16:36:36,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:36:37,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:36:37,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-1.c [2024-11-08 16:36:37,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93536830a/c9ff0e0bcfa641f681aa39117a58d083/FLAGf29b4746b [2024-11-08 16:36:37,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93536830a/c9ff0e0bcfa641f681aa39117a58d083 [2024-11-08 16:36:37,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:36:37,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:36:37,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:36:37,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:36:37,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:36:37,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:36:37" (1/1) ... [2024-11-08 16:36:37,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34155c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:37, skipping insertion in model container [2024-11-08 16:36:37,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:36:37" (1/1) ... [2024-11-08 16:36:37,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:36:39,242 WARN L250 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_label46+token_ring.09.cil-1.c[382357,382370] [2024-11-08 16:36:39,267 WARN L250 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_label46+token_ring.09.cil-1.c[383339,383352] [2024-11-08 16:36:39,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:36:39,513 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:36:40,326 WARN L250 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_label46+token_ring.09.cil-1.c[382357,382370] [2024-11-08 16:36:40,330 WARN L250 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_label46+token_ring.09.cil-1.c[383339,383352] [2024-11-08 16:36:40,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:36:40,418 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:36:40,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40 WrapperNode [2024-11-08 16:36:40,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:36:40,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:36:40,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:36:40,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:36:40,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:40,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:40,896 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13053 [2024-11-08 16:36:40,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:36:40,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:36:40,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:36:40,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:36:40,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:40,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:40,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:41,186 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-11-08 16:36:41,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:41,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:41,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:41,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:41,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:41,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:41,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:36:41,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:36:41,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:36:41,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:36:41,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (1/1) ... [2024-11-08 16:36:41,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:36:41,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:36:41,630 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-11-08 16:36:41,634 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-11-08 16:36:41,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-08 16:36:41,682 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-08 16:36:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-08 16:36:41,683 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-08 16:36:41,684 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-08 16:36:41,684 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-08 16:36:41,684 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-08 16:36:41,684 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-08 16:36:41,684 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-08 16:36:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-08 16:36:41,685 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-08 16:36:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-08 16:36:41,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:36:41,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:36:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:36:41,825 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:36:41,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:36:50,179 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2024-11-08 16:36:50,180 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:36:50,245 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:36:50,245 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-08 16:36:50,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:36:50 BoogieIcfgContainer [2024-11-08 16:36:50,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:36:50,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:36:50,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:36:50,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:36:50,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:36:37" (1/3) ... [2024-11-08 16:36:50,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2794f75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:36:50, skipping insertion in model container [2024-11-08 16:36:50,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:40" (2/3) ... [2024-11-08 16:36:50,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2794f75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:36:50, skipping insertion in model container [2024-11-08 16:36:50,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:36:50" (3/3) ... [2024-11-08 16:36:50,256 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.09.cil-1.c [2024-11-08 16:36:50,276 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:36:50,276 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:36:50,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:36:50,403 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;@1318f3e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:36:50,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:36:50,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 2500 states, 2468 states have (on average 1.8435980551053484) internal successors, (4550), 2471 states have internal predecessors, (4550), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:36:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:36:50,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:36:50,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 16:36:50,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:36:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2141989661, now seen corresponding path program 1 times [2024-11-08 16:36:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:50,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105897209] [2024-11-08 16:36:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:36:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:36:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:36:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:51,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:36:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:51,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:36:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:51,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105897209] [2024-11-08 16:36:51,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105897209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:51,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:51,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:36:51,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326325874] [2024-11-08 16:36:51,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:51,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:36:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:51,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:36:51,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:36:51,091 INFO L87 Difference]: Start difference. First operand has 2500 states, 2468 states have (on average 1.8435980551053484) internal successors, (4550), 2471 states have internal predecessors, (4550), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-08 16:36:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:36:52,732 INFO L93 Difference]: Finished difference Result 5101 states and 9365 transitions. [2024-11-08 16:36:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:36:52,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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 145 [2024-11-08 16:36:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:36:52,762 INFO L225 Difference]: With dead ends: 5101 [2024-11-08 16:36:52,763 INFO L226 Difference]: Without dead ends: 2542 [2024-11-08 16:36:52,774 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-11-08 16:36:52,777 INFO L432 NwaCegarLoop]: 4314 mSDtfsCounter, 821 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 16721 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:36:52,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 16721 Invalid, 855 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:36:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-11-08 16:36:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2433. [2024-11-08 16:36:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2402 states have (on average 1.8288925895087427) internal successors, (4393), 2404 states have internal predecessors, (4393), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:36:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 4439 transitions. [2024-11-08 16:36:52,945 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 4439 transitions. Word has length 145 [2024-11-08 16:36:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:36:52,946 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 4439 transitions. [2024-11-08 16:36:52,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-08 16:36:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 4439 transitions. [2024-11-08 16:36:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:36:52,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:36:52,957 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] [2024-11-08 16:36:52,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:36:52,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:36:52,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:52,958 INFO L85 PathProgramCache]: Analyzing trace with hash -535537185, now seen corresponding path program 1 times [2024-11-08 16:36:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:52,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757564571] [2024-11-08 16:36:52,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:36:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:36:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:36:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:53,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:36:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:36:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:53,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:53,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757564571] [2024-11-08 16:36:53,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757564571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:53,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:53,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:36:53,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934820782] [2024-11-08 16:36:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:53,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:36:53,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:36:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:36:53,415 INFO L87 Difference]: Start difference. First operand 2433 states and 4439 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-11-08 16:36:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:36:55,930 INFO L93 Difference]: Finished difference Result 3253 states and 5746 transitions. [2024-11-08 16:36:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:36:55,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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 145 [2024-11-08 16:36:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:36:55,949 INFO L225 Difference]: With dead ends: 3253 [2024-11-08 16:36:55,949 INFO L226 Difference]: Without dead ends: 2958 [2024-11-08 16:36:55,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:36:55,954 INFO L432 NwaCegarLoop]: 4221 mSDtfsCounter, 5183 mSDsluCounter, 12669 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5199 SdHoareTripleChecker+Valid, 16890 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:36:55,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5199 Valid, 16890 Invalid, 1857 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:36:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2024-11-08 16:36:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2741. [2024-11-08 16:36:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2685 states have (on average 1.8011173184357543) internal successors, (4836), 2688 states have internal predecessors, (4836), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-08 16:36:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4921 transitions. [2024-11-08 16:36:56,055 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4921 transitions. Word has length 145 [2024-11-08 16:36:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:36:56,057 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4921 transitions. [2024-11-08 16:36:56,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-11-08 16:36:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4921 transitions. [2024-11-08 16:36:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:36:56,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:36:56,059 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] [2024-11-08 16:36:56,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:36:56,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:36:56,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1207466339, now seen corresponding path program 1 times [2024-11-08 16:36:56,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:56,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902134714] [2024-11-08 16:36:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:56,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:36:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:36:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:36:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:56,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:36:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:56,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:36:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:56,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:56,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902134714] [2024-11-08 16:36:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902134714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:56,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:56,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:36:56,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613286281] [2024-11-08 16:36:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:56,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:36:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:56,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:36:56,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:36:56,432 INFO L87 Difference]: Start difference. First operand 2741 states and 4921 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:36:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:36:59,437 INFO L93 Difference]: Finished difference Result 3991 states and 6913 transitions. [2024-11-08 16:36:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:36:59,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-08 16:36:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:36:59,455 INFO L225 Difference]: With dead ends: 3991 [2024-11-08 16:36:59,455 INFO L226 Difference]: Without dead ends: 3388 [2024-11-08 16:36:59,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:36:59,460 INFO L432 NwaCegarLoop]: 4421 mSDtfsCounter, 5214 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5230 SdHoareTripleChecker+Valid, 21831 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:36:59,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5230 Valid, 21831 Invalid, 2849 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2794 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 16:36:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2024-11-08 16:36:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3028. [2024-11-08 16:36:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 2947 states have (on average 1.7770614183915847) internal successors, (5237), 2951 states have internal predecessors, (5237), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-08 16:36:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 5360 transitions. [2024-11-08 16:36:59,602 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 5360 transitions. Word has length 145 [2024-11-08 16:36:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:36:59,602 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 5360 transitions. [2024-11-08 16:36:59,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:36:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 5360 transitions. [2024-11-08 16:36:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:36:59,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:36:59,608 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] [2024-11-08 16:36:59,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:36:59,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:36:59,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2140463071, now seen corresponding path program 1 times [2024-11-08 16:36:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375099164] [2024-11-08 16:36:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:59,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:36:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:59,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:36:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:59,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:36:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:59,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:36:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:59,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:36:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:59,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:59,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375099164] [2024-11-08 16:36:59,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375099164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:59,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:59,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:36:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451762279] [2024-11-08 16:36:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:59,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:36:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:59,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:36:59,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:36:59,940 INFO L87 Difference]: Start difference. First operand 3028 states and 5360 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:02,849 INFO L93 Difference]: Finished difference Result 5078 states and 8620 transitions. [2024-11-08 16:37:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:02,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-08 16:37:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:02,872 INFO L225 Difference]: With dead ends: 5078 [2024-11-08 16:37:02,872 INFO L226 Difference]: Without dead ends: 4188 [2024-11-08 16:37:02,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:02,879 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5208 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5224 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:02,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5224 Valid, 21829 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 16:37:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2024-11-08 16:37:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 3606. [2024-11-08 16:37:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 3475 states have (on average 1.7398561151079137) internal successors, (6046), 3481 states have internal predecessors, (6046), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-08 16:37:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 6249 transitions. [2024-11-08 16:37:03,048 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 6249 transitions. Word has length 145 [2024-11-08 16:37:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:03,051 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 6249 transitions. [2024-11-08 16:37:03,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 6249 transitions. [2024-11-08 16:37:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:37:03,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:03,053 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] [2024-11-08 16:37:03,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:37:03,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:03,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash 104095327, now seen corresponding path program 1 times [2024-11-08 16:37:03,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:03,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573428244] [2024-11-08 16:37:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:03,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:03,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:03,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:03,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573428244] [2024-11-08 16:37:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573428244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:03,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:03,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:03,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006274730] [2024-11-08 16:37:03,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:03,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:03,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:03,316 INFO L87 Difference]: Start difference. First operand 3606 states and 6249 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:06,008 INFO L93 Difference]: Finished difference Result 7178 states and 11897 transitions. [2024-11-08 16:37:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:06,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-08 16:37:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:06,035 INFO L225 Difference]: With dead ends: 7178 [2024-11-08 16:37:06,035 INFO L226 Difference]: Without dead ends: 5710 [2024-11-08 16:37:06,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:06,043 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5207 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:06,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 21829 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2760 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:37:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2024-11-08 16:37:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 4763. [2024-11-08 16:37:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4763 states, 4532 states have (on average 1.6910856134157104) internal successors, (7664), 4542 states have internal predecessors, (7664), 167 states have call successors, (167), 54 states have call predecessors, (167), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-08 16:37:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 8033 transitions. [2024-11-08 16:37:06,235 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 8033 transitions. Word has length 145 [2024-11-08 16:37:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:06,235 INFO L471 AbstractCegarLoop]: Abstraction has 4763 states and 8033 transitions. [2024-11-08 16:37:06,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 8033 transitions. [2024-11-08 16:37:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:37:06,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:06,239 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] [2024-11-08 16:37:06,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:37:06,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:06,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash 592142433, now seen corresponding path program 1 times [2024-11-08 16:37:06,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:06,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980995863] [2024-11-08 16:37:06,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:06,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:06,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:06,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:06,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:06,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980995863] [2024-11-08 16:37:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980995863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:06,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:06,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:06,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774250439] [2024-11-08 16:37:06,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:06,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:06,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:06,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:06,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:06,505 INFO L87 Difference]: Start difference. First operand 4763 states and 8033 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:09,478 INFO L93 Difference]: Finished difference Result 11377 states and 18467 transitions. [2024-11-08 16:37:09,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:09,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-08 16:37:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:09,517 INFO L225 Difference]: With dead ends: 11377 [2024-11-08 16:37:09,517 INFO L226 Difference]: Without dead ends: 8752 [2024-11-08 16:37:09,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:09,528 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5206 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:09,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 21829 Invalid, 2804 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:37:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2024-11-08 16:37:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 7084. [2024-11-08 16:37:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7084 states, 6653 states have (on average 1.6398617165188636) internal successors, (10910), 6671 states have internal predecessors, (10910), 311 states have call successors, (311), 102 states have call predecessors, (311), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-08 16:37:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 11629 transitions. [2024-11-08 16:37:09,825 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 11629 transitions. Word has length 145 [2024-11-08 16:37:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:09,825 INFO L471 AbstractCegarLoop]: Abstraction has 7084 states and 11629 transitions. [2024-11-08 16:37:09,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 11629 transitions. [2024-11-08 16:37:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:37:09,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:09,830 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] [2024-11-08 16:37:09,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:37:09,831 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:09,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash -500492769, now seen corresponding path program 1 times [2024-11-08 16:37:09,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:09,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658464256] [2024-11-08 16:37:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:09,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:10,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:10,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:10,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:10,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658464256] [2024-11-08 16:37:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658464256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:10,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:10,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:10,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068545352] [2024-11-08 16:37:10,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:10,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:10,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:10,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:10,078 INFO L87 Difference]: Start difference. First operand 7084 states and 11629 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:12,996 INFO L93 Difference]: Finished difference Result 19776 states and 31669 transitions. [2024-11-08 16:37:12,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:12,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-08 16:37:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:13,064 INFO L225 Difference]: With dead ends: 19776 [2024-11-08 16:37:13,064 INFO L226 Difference]: Without dead ends: 14830 [2024-11-08 16:37:13,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:13,094 INFO L432 NwaCegarLoop]: 4231 mSDtfsCounter, 5285 mSDsluCounter, 16870 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5301 SdHoareTripleChecker+Valid, 21101 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:13,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5301 Valid, 21101 Invalid, 2428 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [87 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 16:37:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14830 states. [2024-11-08 16:37:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14830 to 11741. [2024-11-08 16:37:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 10910 states have (on average 1.5970669110907425) internal successors, (17424), 10944 states have internal predecessors, (17424), 599 states have call successors, (599), 198 states have call predecessors, (599), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-08 16:37:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18897 transitions. [2024-11-08 16:37:13,731 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18897 transitions. Word has length 145 [2024-11-08 16:37:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:13,732 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18897 transitions. [2024-11-08 16:37:13,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18897 transitions. [2024-11-08 16:37:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:37:13,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:13,740 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] [2024-11-08 16:37:13,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:37:13,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1782665055, now seen corresponding path program 1 times [2024-11-08 16:37:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:13,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965048839] [2024-11-08 16:37:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:13,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:13,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965048839] [2024-11-08 16:37:13,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965048839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:13,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:13,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022704176] [2024-11-08 16:37:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:13,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:13,997 INFO L87 Difference]: Start difference. First operand 11741 states and 18897 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:15,662 INFO L93 Difference]: Finished difference Result 24602 states and 39478 transitions. [2024-11-08 16:37:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:37:15,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-08 16:37:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:15,716 INFO L225 Difference]: With dead ends: 24602 [2024-11-08 16:37:15,716 INFO L226 Difference]: Without dead ends: 14999 [2024-11-08 16:37:15,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:37:15,750 INFO L432 NwaCegarLoop]: 4206 mSDtfsCounter, 4993 mSDsluCounter, 12488 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5010 SdHoareTripleChecker+Valid, 16694 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:15,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5010 Valid, 16694 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 16:37:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2024-11-08 16:37:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11741. [2024-11-08 16:37:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 10910 states have (on average 1.5940421631530706) internal successors, (17391), 10944 states have internal predecessors, (17391), 599 states have call successors, (599), 198 states have call predecessors, (599), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-08 16:37:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18864 transitions. [2024-11-08 16:37:16,308 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18864 transitions. Word has length 145 [2024-11-08 16:37:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:16,311 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18864 transitions. [2024-11-08 16:37:16,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18864 transitions. [2024-11-08 16:37:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:37:16,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:16,321 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] [2024-11-08 16:37:16,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:37:16,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:16,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash 669826527, now seen corresponding path program 1 times [2024-11-08 16:37:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283001966] [2024-11-08 16:37:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:16,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:16,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:16,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:16,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283001966] [2024-11-08 16:37:16,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283001966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:16,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:16,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378991458] [2024-11-08 16:37:16,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:16,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:16,551 INFO L87 Difference]: Start difference. First operand 11741 states and 18864 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:19,955 INFO L93 Difference]: Finished difference Result 36541 states and 58035 transitions. [2024-11-08 16:37:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:19,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-08 16:37:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:20,068 INFO L225 Difference]: With dead ends: 36541 [2024-11-08 16:37:20,068 INFO L226 Difference]: Without dead ends: 26938 [2024-11-08 16:37:20,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:20,111 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5197 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5213 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:20,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5213 Valid, 21829 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:37:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26938 states. [2024-11-08 16:37:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26938 to 21119. [2024-11-08 16:37:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21119 states, 19488 states have (on average 1.5633723316912973) internal successors, (30467), 19554 states have internal predecessors, (30467), 1175 states have call successors, (1175), 390 states have call predecessors, (1175), 454 states have return successors, (1968), 1238 states have call predecessors, (1968), 1175 states have call successors, (1968) [2024-11-08 16:37:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21119 states to 21119 states and 33610 transitions. [2024-11-08 16:37:21,413 INFO L78 Accepts]: Start accepts. Automaton has 21119 states and 33610 transitions. Word has length 145 [2024-11-08 16:37:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:21,414 INFO L471 AbstractCegarLoop]: Abstraction has 21119 states and 33610 transitions. [2024-11-08 16:37:21,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 21119 states and 33610 transitions. [2024-11-08 16:37:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:37:21,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:21,435 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] [2024-11-08 16:37:21,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:37:21,435 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:21,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1052176159, now seen corresponding path program 1 times [2024-11-08 16:37:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424455297] [2024-11-08 16:37:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:21,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:21,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:21,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:21,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424455297] [2024-11-08 16:37:21,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424455297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:21,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:21,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:21,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728578477] [2024-11-08 16:37:21,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:21,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:21,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:21,670 INFO L87 Difference]: Start difference. First operand 21119 states and 33610 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:26,213 INFO L93 Difference]: Finished difference Result 70141 states and 111643 transitions. [2024-11-08 16:37:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:26,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-08 16:37:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:26,435 INFO L225 Difference]: With dead ends: 70141 [2024-11-08 16:37:26,435 INFO L226 Difference]: Without dead ends: 51160 [2024-11-08 16:37:26,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:26,504 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5202 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5218 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:26,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5218 Valid, 21829 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2678 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:37:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51160 states. [2024-11-08 16:37:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51160 to 39936. [2024-11-08 16:37:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39936 states, 36705 states have (on average 1.544993870044953) internal successors, (56709), 36835 states have internal predecessors, (56709), 2327 states have call successors, (2327), 774 states have call predecessors, (2327), 902 states have return successors, (4642), 2454 states have call predecessors, (4642), 2327 states have call successors, (4642) [2024-11-08 16:37:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39936 states to 39936 states and 63678 transitions. [2024-11-08 16:37:28,939 INFO L78 Accepts]: Start accepts. Automaton has 39936 states and 63678 transitions. Word has length 145 [2024-11-08 16:37:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:28,940 INFO L471 AbstractCegarLoop]: Abstraction has 39936 states and 63678 transitions. [2024-11-08 16:37:28,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 39936 states and 63678 transitions. [2024-11-08 16:37:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:37:28,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:28,972 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] [2024-11-08 16:37:28,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:37:28,973 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1384819297, now seen corresponding path program 1 times [2024-11-08 16:37:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112360249] [2024-11-08 16:37:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:29,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:29,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:29,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:29,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112360249] [2024-11-08 16:37:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112360249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:29,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:29,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737167238] [2024-11-08 16:37:29,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:29,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:29,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:29,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:29,255 INFO L87 Difference]: Start difference. First operand 39936 states and 63678 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:36,970 INFO L93 Difference]: Finished difference Result 152954 states and 244639 transitions. [2024-11-08 16:37:36,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:37:36,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-08 16:37:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:37,707 INFO L225 Difference]: With dead ends: 152954 [2024-11-08 16:37:37,707 INFO L226 Difference]: Without dead ends: 115156 [2024-11-08 16:37:37,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:37:37,811 INFO L432 NwaCegarLoop]: 4416 mSDtfsCounter, 5279 mSDsluCounter, 17399 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5294 SdHoareTripleChecker+Valid, 21815 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:37,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 21815 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 16:37:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115156 states. [2024-11-08 16:37:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115156 to 76802. [2024-11-08 16:37:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76802 states, 70499 states have (on average 1.537057263223592) internal successors, (108361), 70757 states have internal predecessors, (108361), 4503 states have call successors, (4503), 1542 states have call predecessors, (4503), 1798 states have return successors, (11320), 4758 states have call predecessors, (11320), 4503 states have call successors, (11320) [2024-11-08 16:37:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76802 states to 76802 states and 124184 transitions. [2024-11-08 16:37:42,861 INFO L78 Accepts]: Start accepts. Automaton has 76802 states and 124184 transitions. Word has length 145 [2024-11-08 16:37:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:42,861 INFO L471 AbstractCegarLoop]: Abstraction has 76802 states and 124184 transitions. [2024-11-08 16:37:42,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-08 16:37:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 76802 states and 124184 transitions. [2024-11-08 16:37:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:37:42,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:42,914 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] [2024-11-08 16:37:42,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:37:42,914 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:42,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash 617066973, now seen corresponding path program 1 times [2024-11-08 16:37:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:42,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946357146] [2024-11-08 16:37:42,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:42,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:43,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:43,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946357146] [2024-11-08 16:37:43,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946357146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:43,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:43,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:43,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661996613] [2024-11-08 16:37:43,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:43,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:43,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:43,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:43,121 INFO L87 Difference]: Start difference. First operand 76802 states and 124184 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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)