./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.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 eebca77f45674e9c747126627d8fffbab7911c70d4e1d781272ecaec26772b5e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 23:24:18,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 23:24:18,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 23:24:18,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 23:24:18,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 23:24:18,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 23:24:18,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 23:24:18,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 23:24:18,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 23:24:18,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 23:24:18,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 23:24:18,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 23:24:18,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 23:24:18,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 23:24:18,320 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 23:24:18,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 23:24:18,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 23:24:18,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 23:24:18,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 23:24:18,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 23:24:18,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 23:24:18,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 23:24:18,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 23:24:18,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 23:24:18,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 23:24:18,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 23:24:18,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 23:24:18,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 23:24:18,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 23:24:18,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 23:24:18,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 23:24:18,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 23:24:18,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:24:18,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 23:24:18,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 23:24:18,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 23:24:18,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 23:24:18,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 23:24:18,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 23:24:18,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 23:24:18,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 23:24:18,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 23:24:18,329 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 -> eebca77f45674e9c747126627d8fffbab7911c70d4e1d781272ecaec26772b5e [2024-11-19 23:24:18,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 23:24:18,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 23:24:18,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 23:24:18,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 23:24:18,581 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 23:24:18,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c [2024-11-19 23:24:19,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 23:24:20,419 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 23:24:20,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c [2024-11-19 23:24:20,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5599bfe/330d914144d0443a9f6d72cf871f8397/FLAG2b04457d9 [2024-11-19 23:24:20,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5599bfe/330d914144d0443a9f6d72cf871f8397 [2024-11-19 23:24:20,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 23:24:20,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 23:24:20,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 23:24:20,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 23:24:20,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 23:24:20,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:24:20" (1/1) ... [2024-11-19 23:24:20,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289a0f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:20, skipping insertion in model container [2024-11-19 23:24:20,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:24:20" (1/1) ... [2024-11-19 23:24:20,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 23:24:21,915 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_label44+token_ring.09.cil-1.c[377340,377353] [2024-11-19 23:24:21,940 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_label44+token_ring.09.cil-1.c[383339,383352] [2024-11-19 23:24:22,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:24:22,094 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 23:24:22,715 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_label44+token_ring.09.cil-1.c[377340,377353] [2024-11-19 23:24:22,728 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_label44+token_ring.09.cil-1.c[383339,383352] [2024-11-19 23:24:22,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:24:22,859 INFO L204 MainTranslator]: Completed translation [2024-11-19 23:24:22,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22 WrapperNode [2024-11-19 23:24:22,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 23:24:22,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 23:24:22,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 23:24:22,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 23:24:22,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:22,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,171 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13053 [2024-11-19 23:24:23,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 23:24:23,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 23:24:23,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 23:24:23,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 23:24:23,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,398 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-19 23:24:23,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 23:24:23,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 23:24:23,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 23:24:23,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 23:24:23,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (1/1) ... [2024-11-19 23:24:23,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:24:23,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:24:23,704 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-19 23:24:23,834 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-19 23:24:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 23:24:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-19 23:24:23,888 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-19 23:24:23,888 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-19 23:24:23,889 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-19 23:24:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-19 23:24:23,889 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-19 23:24:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-19 23:24:23,889 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-19 23:24:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-19 23:24:23,890 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-19 23:24:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-19 23:24:23,890 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-19 23:24:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 23:24:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 23:24:23,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 23:24:23,976 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 23:24:23,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 23:24:30,501 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2024-11-19 23:24:30,501 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 23:24:30,547 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 23:24:30,547 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-19 23:24:30,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:24:30 BoogieIcfgContainer [2024-11-19 23:24:30,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 23:24:30,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 23:24:30,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 23:24:30,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 23:24:30,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:24:20" (1/3) ... [2024-11-19 23:24:30,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1131d44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:24:30, skipping insertion in model container [2024-11-19 23:24:30,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:24:22" (2/3) ... [2024-11-19 23:24:30,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1131d44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:24:30, skipping insertion in model container [2024-11-19 23:24:30,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:24:30" (3/3) ... [2024-11-19 23:24:30,555 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.09.cil-1.c [2024-11-19 23:24:30,566 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 23:24:30,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 23:24:30,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 23:24:30,669 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;@1bcbb60f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 23:24:30,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 23:24:30,689 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-19 23:24:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:30,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:30,714 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-19 23:24:30,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2141989661, now seen corresponding path program 1 times [2024-11-19 23:24:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794963067] [2024-11-19 23:24:30,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:31,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:31,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:31,201 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-19 23:24:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794963067] [2024-11-19 23:24:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794963067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 23:24:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324752987] [2024-11-19 23:24:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:31,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 23:24:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:31,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 23:24:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 23:24:31,241 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-19 23:24:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:24:32,585 INFO L93 Difference]: Finished difference Result 5101 states and 9365 transitions. [2024-11-19 23:24:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 23:24:32,587 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-19 23:24:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:24:32,610 INFO L225 Difference]: With dead ends: 5101 [2024-11-19 23:24:32,610 INFO L226 Difference]: Without dead ends: 2542 [2024-11-19 23:24:32,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 23:24:32,626 INFO L432 NwaCegarLoop]: 4314 mSDtfsCounter, 821 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 23:24:32,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 16721 Invalid, 855 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 23:24:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-11-19 23:24:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2433. [2024-11-19 23:24:32,786 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-19 23:24:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 4439 transitions. [2024-11-19 23:24:32,812 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 4439 transitions. Word has length 145 [2024-11-19 23:24:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:24:32,813 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 4439 transitions. [2024-11-19 23:24:32,813 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-19 23:24:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 4439 transitions. [2024-11-19 23:24:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:32,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:32,820 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-19 23:24:32,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 23:24:32,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:32,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash -535537185, now seen corresponding path program 1 times [2024-11-19 23:24:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168720235] [2024-11-19 23:24:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:33,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:33,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:33,150 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-19 23:24:33,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:33,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168720235] [2024-11-19 23:24:33,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168720235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:33,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:33,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 23:24:33,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936025848] [2024-11-19 23:24:33,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:33,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 23:24:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:33,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 23:24:33,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 23:24:33,157 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-19 23:24:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:24:35,050 INFO L93 Difference]: Finished difference Result 3253 states and 5746 transitions. [2024-11-19 23:24:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 23:24:35,050 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-19 23:24:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:24:35,077 INFO L225 Difference]: With dead ends: 3253 [2024-11-19 23:24:35,078 INFO L226 Difference]: Without dead ends: 2958 [2024-11-19 23:24:35,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-19 23:24:35,081 INFO L432 NwaCegarLoop]: 4221 mSDtfsCounter, 5183 mSDsluCounter, 12669 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 23:24:35,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5199 Valid, 16890 Invalid, 1857 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 23:24:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2024-11-19 23:24:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2741. [2024-11-19 23:24:35,241 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-19 23:24:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4921 transitions. [2024-11-19 23:24:35,252 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4921 transitions. Word has length 145 [2024-11-19 23:24:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:24:35,252 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4921 transitions. [2024-11-19 23:24:35,253 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-19 23:24:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4921 transitions. [2024-11-19 23:24:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:35,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:35,255 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-19 23:24:35,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 23:24:35,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:35,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1207466339, now seen corresponding path program 1 times [2024-11-19 23:24:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:35,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968162130] [2024-11-19 23:24:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:35,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:35,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:35,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:35,500 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-19 23:24:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:35,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968162130] [2024-11-19 23:24:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968162130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:35,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:24:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048270313] [2024-11-19 23:24:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:35,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:24:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:35,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:24:35,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:24:35,503 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-19 23:24:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:24:38,784 INFO L93 Difference]: Finished difference Result 3991 states and 6913 transitions. [2024-11-19 23:24:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:24:38,785 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-19 23:24:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:24:38,797 INFO L225 Difference]: With dead ends: 3991 [2024-11-19 23:24:38,797 INFO L226 Difference]: Without dead ends: 3388 [2024-11-19 23:24:38,799 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-19 23:24:38,800 INFO L432 NwaCegarLoop]: 4421 mSDtfsCounter, 5214 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 23:24:38,801 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.4s Time] [2024-11-19 23:24:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2024-11-19 23:24:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3028. [2024-11-19 23:24:38,863 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-19 23:24:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 5360 transitions. [2024-11-19 23:24:38,870 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 5360 transitions. Word has length 145 [2024-11-19 23:24:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:24:38,870 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 5360 transitions. [2024-11-19 23:24:38,870 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-19 23:24:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 5360 transitions. [2024-11-19 23:24:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:38,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:38,872 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-19 23:24:38,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 23:24:38,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:38,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2140463071, now seen corresponding path program 1 times [2024-11-19 23:24:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865979534] [2024-11-19 23:24:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:39,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:39,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:39,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:39,070 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-19 23:24:39,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865979534] [2024-11-19 23:24:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865979534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:39,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:24:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508677175] [2024-11-19 23:24:39,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:24:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:39,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:24:39,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:24:39,073 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-19 23:24:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:24:41,516 INFO L93 Difference]: Finished difference Result 5078 states and 8620 transitions. [2024-11-19 23:24:41,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:24:41,516 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-19 23:24:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:24:41,549 INFO L225 Difference]: With dead ends: 5078 [2024-11-19 23:24:41,549 INFO L226 Difference]: Without dead ends: 4188 [2024-11-19 23:24:41,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:24:41,559 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5208 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5224 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:24:41,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5224 Valid, 21829 Invalid, 2830 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 23:24:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2024-11-19 23:24:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 3606. [2024-11-19 23:24:41,753 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-19 23:24:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 6249 transitions. [2024-11-19 23:24:41,772 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 6249 transitions. Word has length 145 [2024-11-19 23:24:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:24:41,773 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 6249 transitions. [2024-11-19 23:24:41,773 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-19 23:24:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 6249 transitions. [2024-11-19 23:24:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:41,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:41,779 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-19 23:24:41,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 23:24:41,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:41,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash 104095327, now seen corresponding path program 1 times [2024-11-19 23:24:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:41,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770544161] [2024-11-19 23:24:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:41,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:41,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:41,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:41,984 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-19 23:24:41,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:41,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770544161] [2024-11-19 23:24:41,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770544161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:41,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:41,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:24:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670748595] [2024-11-19 23:24:41,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:41,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:24:41,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:41,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:24:41,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:24:41,988 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-19 23:24:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:24:44,494 INFO L93 Difference]: Finished difference Result 7178 states and 11897 transitions. [2024-11-19 23:24:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:24:44,495 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-19 23:24:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:24:44,517 INFO L225 Difference]: With dead ends: 7178 [2024-11-19 23:24:44,517 INFO L226 Difference]: Without dead ends: 5710 [2024-11-19 23:24:44,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:24:44,524 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5207 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:24:44,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 21829 Invalid, 2817 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2760 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 23:24:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2024-11-19 23:24:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 4763. [2024-11-19 23:24:44,661 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-19 23:24:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 8033 transitions. [2024-11-19 23:24:44,673 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 8033 transitions. Word has length 145 [2024-11-19 23:24:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:24:44,674 INFO L471 AbstractCegarLoop]: Abstraction has 4763 states and 8033 transitions. [2024-11-19 23:24:44,674 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-19 23:24:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 8033 transitions. [2024-11-19 23:24:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:44,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:44,676 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-19 23:24:44,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 23:24:44,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:44,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 592142433, now seen corresponding path program 1 times [2024-11-19 23:24:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:44,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416082374] [2024-11-19 23:24:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:44,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:44,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:44,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:44,852 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-19 23:24:44,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:44,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416082374] [2024-11-19 23:24:44,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416082374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:44,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:44,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:24:44,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19317253] [2024-11-19 23:24:44,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:44,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:24:44,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:44,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:24:44,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:24:44,855 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-19 23:24:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:24:47,593 INFO L93 Difference]: Finished difference Result 11377 states and 18467 transitions. [2024-11-19 23:24:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:24:47,593 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-19 23:24:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:24:47,633 INFO L225 Difference]: With dead ends: 11377 [2024-11-19 23:24:47,633 INFO L226 Difference]: Without dead ends: 8752 [2024-11-19 23:24:47,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:24:47,644 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5206 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:24:47,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 21829 Invalid, 2804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 23:24:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2024-11-19 23:24:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 7084. [2024-11-19 23:24:47,854 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-19 23:24:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 11629 transitions. [2024-11-19 23:24:47,869 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 11629 transitions. Word has length 145 [2024-11-19 23:24:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:24:47,870 INFO L471 AbstractCegarLoop]: Abstraction has 7084 states and 11629 transitions. [2024-11-19 23:24:47,870 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-19 23:24:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 11629 transitions. [2024-11-19 23:24:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:47,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:47,874 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-19 23:24:47,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 23:24:47,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:47,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash -500492769, now seen corresponding path program 1 times [2024-11-19 23:24:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:47,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10686100] [2024-11-19 23:24:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:47,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:47,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:48,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:48,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:48,059 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-19 23:24:48,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:48,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10686100] [2024-11-19 23:24:48,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10686100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:48,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:48,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:24:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420104859] [2024-11-19 23:24:48,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:48,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:24:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:48,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:24:48,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:24:48,061 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-19 23:24:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:24:50,860 INFO L93 Difference]: Finished difference Result 19776 states and 31669 transitions. [2024-11-19 23:24:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:24:50,860 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-19 23:24:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:24:50,897 INFO L225 Difference]: With dead ends: 19776 [2024-11-19 23:24:50,897 INFO L226 Difference]: Without dead ends: 14830 [2024-11-19 23:24:50,913 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-19 23:24:50,914 INFO L432 NwaCegarLoop]: 4231 mSDtfsCounter, 5285 mSDsluCounter, 16870 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5301 SdHoareTripleChecker+Valid, 21101 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 23:24:50,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5301 Valid, 21101 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 23:24:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14830 states. [2024-11-19 23:24:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14830 to 11741. [2024-11-19 23:24:51,452 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-19 23:24:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18897 transitions. [2024-11-19 23:24:51,476 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18897 transitions. Word has length 145 [2024-11-19 23:24:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:24:51,476 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18897 transitions. [2024-11-19 23:24:51,476 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-19 23:24:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18897 transitions. [2024-11-19 23:24:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:51,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:51,483 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-19 23:24:51,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 23:24:51,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:51,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1782665055, now seen corresponding path program 1 times [2024-11-19 23:24:51,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569064233] [2024-11-19 23:24:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:51,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:51,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:51,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:51,643 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-19 23:24:51,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:51,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569064233] [2024-11-19 23:24:51,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569064233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:51,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:51,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:24:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656312094] [2024-11-19 23:24:51,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:51,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:24:51,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:51,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:24:51,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:24:51,644 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-19 23:24:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:24:53,075 INFO L93 Difference]: Finished difference Result 24602 states and 39478 transitions. [2024-11-19 23:24:53,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 23:24:53,076 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-19 23:24:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:24:53,119 INFO L225 Difference]: With dead ends: 24602 [2024-11-19 23:24:53,120 INFO L226 Difference]: Without dead ends: 14999 [2024-11-19 23:24:53,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-19 23:24:53,148 INFO L432 NwaCegarLoop]: 4206 mSDtfsCounter, 4993 mSDsluCounter, 12488 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:24:53,148 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.8s Time] [2024-11-19 23:24:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2024-11-19 23:24:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11741. [2024-11-19 23:24:53,735 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-19 23:24:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18864 transitions. [2024-11-19 23:24:53,759 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18864 transitions. Word has length 145 [2024-11-19 23:24:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:24:53,760 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18864 transitions. [2024-11-19 23:24:53,761 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-19 23:24:53,761 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18864 transitions. [2024-11-19 23:24:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:53,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:53,768 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-19 23:24:53,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 23:24:53,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:53,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash 669826527, now seen corresponding path program 1 times [2024-11-19 23:24:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:53,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183037107] [2024-11-19 23:24:53,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:53,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:53,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:53,932 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-19 23:24:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:53,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183037107] [2024-11-19 23:24:53,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183037107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:53,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:53,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:24:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841364506] [2024-11-19 23:24:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:53,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:24:53,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:24:53,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:24:53,935 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-19 23:24:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:24:57,103 INFO L93 Difference]: Finished difference Result 36541 states and 58035 transitions. [2024-11-19 23:24:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:24:57,103 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-19 23:24:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:24:57,174 INFO L225 Difference]: With dead ends: 36541 [2024-11-19 23:24:57,174 INFO L226 Difference]: Without dead ends: 26938 [2024-11-19 23:24:57,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:24:57,204 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5197 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:24:57,204 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.8s Time] [2024-11-19 23:24:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26938 states. [2024-11-19 23:24:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26938 to 21119. [2024-11-19 23:24:58,296 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-19 23:24:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21119 states to 21119 states and 33610 transitions. [2024-11-19 23:24:58,359 INFO L78 Accepts]: Start accepts. Automaton has 21119 states and 33610 transitions. Word has length 145 [2024-11-19 23:24:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:24:58,360 INFO L471 AbstractCegarLoop]: Abstraction has 21119 states and 33610 transitions. [2024-11-19 23:24:58,360 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-19 23:24:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 21119 states and 33610 transitions. [2024-11-19 23:24:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:24:58,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:24:58,372 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-19 23:24:58,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 23:24:58,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:24:58,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:24:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1052176159, now seen corresponding path program 1 times [2024-11-19 23:24:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:24:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137696070] [2024-11-19 23:24:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:24:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:24:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:58,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:24:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:24:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:24:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:24:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:24:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:24:58,573 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-19 23:24:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:24:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137696070] [2024-11-19 23:24:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137696070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:24:58,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:24:58,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:24:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551193790] [2024-11-19 23:24:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:24:58,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:24:58,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:24:58,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:24:58,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:24:58,576 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-19 23:25:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:25:02,889 INFO L93 Difference]: Finished difference Result 70141 states and 111643 transitions. [2024-11-19 23:25:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:25:02,889 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-19 23:25:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:25:03,042 INFO L225 Difference]: With dead ends: 70141 [2024-11-19 23:25:03,043 INFO L226 Difference]: Without dead ends: 51160 [2024-11-19 23:25:03,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:25:03,092 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5202 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:25:03,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5218 Valid, 21829 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2678 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 23:25:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51160 states. [2024-11-19 23:25:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51160 to 39936. [2024-11-19 23:25:05,580 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-19 23:25:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39936 states to 39936 states and 63678 transitions. [2024-11-19 23:25:05,879 INFO L78 Accepts]: Start accepts. Automaton has 39936 states and 63678 transitions. Word has length 145 [2024-11-19 23:25:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:25:05,879 INFO L471 AbstractCegarLoop]: Abstraction has 39936 states and 63678 transitions. [2024-11-19 23:25:05,880 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-19 23:25:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 39936 states and 63678 transitions. [2024-11-19 23:25:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:25:05,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:25:05,900 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-19 23:25:05,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 23:25:05,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:25:05,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:25:05,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1384819297, now seen corresponding path program 1 times [2024-11-19 23:25:05,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:25:05,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780293635] [2024-11-19 23:25:05,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:25:05,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:25:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:05,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:25:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:06,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:25:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:25:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:06,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:25:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:25:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:25:06,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:25:06,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780293635] [2024-11-19 23:25:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780293635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:25:06,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:25:06,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:25:06,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609174424] [2024-11-19 23:25:06,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:25:06,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:25:06,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:25:06,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:25:06,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:25:06,137 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-19 23:25:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:25:13,588 INFO L93 Difference]: Finished difference Result 152954 states and 244639 transitions. [2024-11-19 23:25:13,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 23:25:13,588 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-19 23:25:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:25:14,347 INFO L225 Difference]: With dead ends: 152954 [2024-11-19 23:25:14,347 INFO L226 Difference]: Without dead ends: 115156 [2024-11-19 23:25:14,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-19 23:25:14,429 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.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 23:25:14,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 21815 Invalid, 3256 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 23:25:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115156 states. [2024-11-19 23:25:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115156 to 76802. [2024-11-19 23:25:18,271 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-19 23:25:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76802 states to 76802 states and 124184 transitions. [2024-11-19 23:25:18,506 INFO L78 Accepts]: Start accepts. Automaton has 76802 states and 124184 transitions. Word has length 145 [2024-11-19 23:25:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:25:18,507 INFO L471 AbstractCegarLoop]: Abstraction has 76802 states and 124184 transitions. [2024-11-19 23:25:18,507 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-19 23:25:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 76802 states and 124184 transitions. [2024-11-19 23:25:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:25:18,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:25:18,574 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-19 23:25:18,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 23:25:18,575 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:25:18,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:25:18,575 INFO L85 PathProgramCache]: Analyzing trace with hash 617066973, now seen corresponding path program 1 times [2024-11-19 23:25:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:25:18,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977644848] [2024-11-19 23:25:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:25:18,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:25:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:25:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:18,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:25:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:25:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:25:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:25:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:25:18,847 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-19 23:25:18,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:25:18,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977644848] [2024-11-19 23:25:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977644848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:25:18,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:25:18,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:25:18,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124979987] [2024-11-19 23:25:18,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:25:18,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:25:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:25:18,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:25:18,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:25:18,849 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)