./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4193af75abf6aff12bf0c3b1d52895798f02d5d81afc60ee7b84e09fa25d7f81 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:36:36,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:36:36,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:36:36,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:36:36,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:36:36,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:36:36,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:36:36,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:36:36,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:36:36,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:36:36,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:36:36,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:36:36,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:36:36,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:36:36,943 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:36:36,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:36:36,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:36:36,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:36:36,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:36:36,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:36:36,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:36:36,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:36:36,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:36:36,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:36:36,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:36:36,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:36:36,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:36:36,947 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:36:36,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:36:36,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:36:36,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:36:36,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:36:36,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:36:36,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:36:36,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:36:36,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:36:36,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:36:36,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:36:36,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:36:36,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:36:36,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:36:36,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:36:36,955 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 -> 4193af75abf6aff12bf0c3b1d52895798f02d5d81afc60ee7b84e09fa25d7f81 [2024-11-08 16:36:37,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:36:37,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:36:37,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:36:37,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:36:37,270 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:36:37,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c [2024-11-08 16:36:38,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:36:39,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:36:39,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c [2024-11-08 16:36:39,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188e37e50/8c384148be524f31add9046727f4d3a2/FLAGa5bbbe2c7 [2024-11-08 16:36:39,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188e37e50/8c384148be524f31add9046727f4d3a2 [2024-11-08 16:36:39,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:36:39,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:36:39,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:36:39,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:36:39,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:36:39,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:36:39" (1/1) ... [2024-11-08 16:36:39,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db4274d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:39, skipping insertion in model container [2024-11-08 16:36:39,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:36:39" (1/1) ... [2024-11-08 16:36:39,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:36:41,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c[382357,382370] [2024-11-08 16:36:41,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c[383339,383352] [2024-11-08 16:36:41,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:36:41,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:36:41,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c[382357,382370] [2024-11-08 16:36:41,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.09.cil-2.c[383339,383352] [2024-11-08 16:36:42,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:36:42,081 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:36:42,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42 WrapperNode [2024-11-08 16:36:42,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:36:42,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:36:42,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:36:42,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:36:42,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:42,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:42,582 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13059 [2024-11-08 16:36:42,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:36:42,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:36:42,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:36:42,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:36:42,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:42,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:42,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:42,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:36:42,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:42,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:43,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:43,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:43,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:43,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:43,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:36:43,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:36:43,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:36:43,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:36:43,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (1/1) ... [2024-11-08 16:36:43,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:36:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:36:43,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:36:43,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:36:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:36:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-08 16:36:43,462 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-08 16:36:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-08 16:36:43,462 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-08 16:36:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-08 16:36:43,463 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-08 16:36:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-08 16:36:43,463 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-08 16:36:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-08 16:36:43,463 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-08 16:36:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-08 16:36:43,463 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-08 16:36:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-08 16:36:43,463 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-08 16:36:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:36:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:36:43,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:36:43,715 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:36:43,717 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:36:51,574 INFO L? ?]: Removed 1741 outVars from TransFormulas that were not future-live. [2024-11-08 16:36:51,574 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:36:51,649 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:36:51,649 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-08 16:36:51,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:36:51 BoogieIcfgContainer [2024-11-08 16:36:51,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:36:51,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:36:51,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:36:51,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:36:51,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:36:39" (1/3) ... [2024-11-08 16:36:51,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11316dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:36:51, skipping insertion in model container [2024-11-08 16:36:51,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:42" (2/3) ... [2024-11-08 16:36:51,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11316dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:36:51, skipping insertion in model container [2024-11-08 16:36:51,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:36:51" (3/3) ... [2024-11-08 16:36:51,659 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.09.cil-2.c [2024-11-08 16:36:51,677 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:36:51,678 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:36:51,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:36:51,808 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;@620092e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:36:51,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:36:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 2508 states, 2473 states have (on average 1.8439142741609382) internal successors, (4560), 2478 states have internal predecessors, (4560), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:36:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:36:51,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:36:51,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:51,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:36:51,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash 273379068, now seen corresponding path program 1 times [2024-11-08 16:36:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:51,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523855692] [2024-11-08 16:36:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:51,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:36:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:52,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:36:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:52,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:36:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:36:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:36:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523855692] [2024-11-08 16:36:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523855692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:52,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:52,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:36:52,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353844649] [2024-11-08 16:36:52,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:52,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:36:52,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:36:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:36:52,503 INFO L87 Difference]: Start difference. First operand has 2508 states, 2473 states have (on average 1.8439142741609382) internal successors, (4560), 2478 states have internal predecessors, (4560), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) 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, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:36:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:36:54,196 INFO L93 Difference]: Finished difference Result 5116 states and 9393 transitions. [2024-11-08 16:36:54,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:36:54,199 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, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:36:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:36:54,234 INFO L225 Difference]: With dead ends: 5116 [2024-11-08 16:36:54,235 INFO L226 Difference]: Without dead ends: 2549 [2024-11-08 16:36:54,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:36:54,252 INFO L432 NwaCegarLoop]: 4325 mSDtfsCounter, 835 mSDsluCounter, 12425 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:36:54,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 16750 Invalid, 860 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 16:36:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2024-11-08 16:36:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2440. [2024-11-08 16:36:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2407 states have (on average 1.8292480265891151) internal successors, (4403), 2410 states have internal predecessors, (4403), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:36:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4451 transitions. [2024-11-08 16:36:54,419 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4451 transitions. Word has length 146 [2024-11-08 16:36:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:36:54,420 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4451 transitions. [2024-11-08 16:36:54,420 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, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:36:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4451 transitions. [2024-11-08 16:36:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:36:54,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:36:54,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:54,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:36:54,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:36:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1125574534, now seen corresponding path program 1 times [2024-11-08 16:36:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680101270] [2024-11-08 16:36:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:54,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:36:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:36:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:54,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:36:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:36:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:36:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680101270] [2024-11-08 16:36:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680101270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:54,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:36:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726119940] [2024-11-08 16:36:54,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:54,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:36:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:36:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:36:54,816 INFO L87 Difference]: Start difference. First operand 2440 states and 4451 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:36:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:36:57,423 INFO L93 Difference]: Finished difference Result 3274 states and 5782 transitions. [2024-11-08 16:36:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:36:57,424 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:36:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:36:57,437 INFO L225 Difference]: With dead ends: 3274 [2024-11-08 16:36:57,438 INFO L226 Difference]: Without dead ends: 2972 [2024-11-08 16:36:57,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:36:57,441 INFO L432 NwaCegarLoop]: 4271 mSDtfsCounter, 5199 mSDsluCounter, 12786 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 17057 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:36:57,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 17057 Invalid, 1908 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 16:36:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2024-11-08 16:36:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2753. [2024-11-08 16:36:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2695 states have (on average 1.8018552875695732) internal successors, (4856), 2699 states have internal predecessors, (4856), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-08 16:36:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 4943 transitions. [2024-11-08 16:36:57,544 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 4943 transitions. Word has length 146 [2024-11-08 16:36:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:36:57,544 INFO L471 AbstractCegarLoop]: Abstraction has 2753 states and 4943 transitions. [2024-11-08 16:36:57,545 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:36:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 4943 transitions. [2024-11-08 16:36:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:36:57,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:36:57,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:57,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:36:57,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:36:57,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:57,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1367927158, now seen corresponding path program 1 times [2024-11-08 16:36:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:57,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419943459] [2024-11-08 16:36:57,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:57,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:36:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:57,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:36:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:57,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:36:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:57,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:36:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:36:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:57,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419943459] [2024-11-08 16:36:57,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419943459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:57,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:57,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:36:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835994063] [2024-11-08 16:36:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:57,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:36:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:57,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:36:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:36:57,890 INFO L87 Difference]: Start difference. First operand 2753 states and 4943 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:00,757 INFO L93 Difference]: Finished difference Result 4022 states and 6969 transitions. [2024-11-08 16:37:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:00,758 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:37:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:00,776 INFO L225 Difference]: With dead ends: 4022 [2024-11-08 16:37:00,776 INFO L226 Difference]: Without dead ends: 3407 [2024-11-08 16:37:00,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:00,784 INFO L432 NwaCegarLoop]: 4443 mSDtfsCounter, 5228 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5244 SdHoareTripleChecker+Valid, 21936 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:00,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5244 Valid, 21936 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 16:37:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2024-11-08 16:37:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3045. [2024-11-08 16:37:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 2962 states have (on average 1.7781904118838623) internal successors, (5267), 2967 states have internal predecessors, (5267), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-08 16:37:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 5392 transitions. [2024-11-08 16:37:00,977 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 5392 transitions. Word has length 146 [2024-11-08 16:37:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:00,977 INFO L471 AbstractCegarLoop]: Abstraction has 3045 states and 5392 transitions. [2024-11-08 16:37:00,978 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 5392 transitions. [2024-11-08 16:37:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:37:00,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:00,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:00,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:37:00,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:00,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash 661330552, now seen corresponding path program 1 times [2024-11-08 16:37:00,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:00,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236347814] [2024-11-08 16:37:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236347814] [2024-11-08 16:37:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236347814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:01,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929675707] [2024-11-08 16:37:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:01,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:01,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:01,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:01,210 INFO L87 Difference]: Start difference. First operand 3045 states and 5392 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:03,738 INFO L93 Difference]: Finished difference Result 5124 states and 8706 transitions. [2024-11-08 16:37:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:03,739 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:37:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:03,759 INFO L225 Difference]: With dead ends: 5124 [2024-11-08 16:37:03,759 INFO L226 Difference]: Without dead ends: 4217 [2024-11-08 16:37:03,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:03,767 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5222 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5238 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:03,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5238 Valid, 21934 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:37:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2024-11-08 16:37:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 3633. [2024-11-08 16:37:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3500 states have (on average 1.7417142857142858) internal successors, (6096), 3507 states have internal predecessors, (6096), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-08 16:37:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 6301 transitions. [2024-11-08 16:37:04,008 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 6301 transitions. Word has length 146 [2024-11-08 16:37:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:04,008 INFO L471 AbstractCegarLoop]: Abstraction has 3633 states and 6301 transitions. [2024-11-08 16:37:04,009 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 6301 transitions. [2024-11-08 16:37:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:37:04,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:04,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:04,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:37:04,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1523164154, now seen corresponding path program 1 times [2024-11-08 16:37:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:04,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306899236] [2024-11-08 16:37:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:04,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:04,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:04,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306899236] [2024-11-08 16:37:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306899236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:04,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:04,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:04,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677301458] [2024-11-08 16:37:04,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:04,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:04,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:04,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:04,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:04,343 INFO L87 Difference]: Start difference. First operand 3633 states and 6301 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:07,385 INFO L93 Difference]: Finished difference Result 7254 states and 12043 transitions. [2024-11-08 16:37:07,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:07,386 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:37:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:07,413 INFO L225 Difference]: With dead ends: 7254 [2024-11-08 16:37:07,413 INFO L226 Difference]: Without dead ends: 5759 [2024-11-08 16:37:07,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:07,422 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5221 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5237 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:07,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5237 Valid, 21934 Invalid, 2836 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2775 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 16:37:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2024-11-08 16:37:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 4810. [2024-11-08 16:37:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4577 states have (on average 1.694122787852305) internal successors, (7754), 4588 states have internal predecessors, (7754), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-08 16:37:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 8125 transitions. [2024-11-08 16:37:07,699 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 8125 transitions. Word has length 146 [2024-11-08 16:37:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:07,699 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 8125 transitions. [2024-11-08 16:37:07,699 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 8125 transitions. [2024-11-08 16:37:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:37:07,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:07,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:07,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:37:07,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:07,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:07,704 INFO L85 PathProgramCache]: Analyzing trace with hash -527244744, now seen corresponding path program 1 times [2024-11-08 16:37:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:07,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033278260] [2024-11-08 16:37:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:07,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:07,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:07,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:07,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:07,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033278260] [2024-11-08 16:37:07,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033278260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:07,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:07,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:07,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178515152] [2024-11-08 16:37:07,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:07,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:07,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:07,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:07,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:07,964 INFO L87 Difference]: Start difference. First operand 4810 states and 8125 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:10,852 INFO L93 Difference]: Finished difference Result 11513 states and 18733 transitions. [2024-11-08 16:37:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:10,853 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:37:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:10,891 INFO L225 Difference]: With dead ends: 11513 [2024-11-08 16:37:10,891 INFO L226 Difference]: Without dead ends: 8841 [2024-11-08 16:37:10,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:10,905 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5220 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2762 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5236 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:10,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5236 Valid, 21934 Invalid, 2823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2762 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 16:37:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2024-11-08 16:37:11,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 7171. [2024-11-08 16:37:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7171 states, 6738 states have (on average 1.6444048679133274) internal successors, (11080), 6757 states have internal predecessors, (11080), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-08 16:37:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 11801 transitions. [2024-11-08 16:37:11,368 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 11801 transitions. Word has length 146 [2024-11-08 16:37:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:11,369 INFO L471 AbstractCegarLoop]: Abstraction has 7171 states and 11801 transitions. [2024-11-08 16:37:11,370 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 11801 transitions. [2024-11-08 16:37:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:37:11,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:11,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:11,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:37:11,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:11,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash -39197638, now seen corresponding path program 1 times [2024-11-08 16:37:11,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:11,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631297283] [2024-11-08 16:37:11,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:11,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:11,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:11,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:11,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:11,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:11,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631297283] [2024-11-08 16:37:11,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631297283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:11,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:11,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:11,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111104693] [2024-11-08 16:37:11,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:11,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:11,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:11,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:11,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:11,628 INFO L87 Difference]: Start difference. First operand 7171 states and 11801 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:14,258 INFO L93 Difference]: Finished difference Result 20032 states and 32175 transitions. [2024-11-08 16:37:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:14,259 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:37:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:14,316 INFO L225 Difference]: With dead ends: 20032 [2024-11-08 16:37:14,316 INFO L226 Difference]: Without dead ends: 14999 [2024-11-08 16:37:14,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:14,342 INFO L432 NwaCegarLoop]: 4242 mSDtfsCounter, 5301 mSDsluCounter, 16917 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5317 SdHoareTripleChecker+Valid, 21159 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:14,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5317 Valid, 21159 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 16:37:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2024-11-08 16:37:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11908. [2024-11-08 16:37:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11908 states, 11075 states have (on average 1.6030699774266366) internal successors, (17754), 11110 states have internal predecessors, (17754), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-08 16:37:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 19229 transitions. [2024-11-08 16:37:15,002 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 19229 transitions. Word has length 146 [2024-11-08 16:37:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:15,002 INFO L471 AbstractCegarLoop]: Abstraction has 11908 states and 19229 transitions. [2024-11-08 16:37:15,003 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 19229 transitions. [2024-11-08 16:37:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:37:15,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:15,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:15,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:37:15,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:15,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1131832840, now seen corresponding path program 1 times [2024-11-08 16:37:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793464158] [2024-11-08 16:37:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:15,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:15,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:15,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793464158] [2024-11-08 16:37:15,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793464158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:15,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:15,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789419548] [2024-11-08 16:37:15,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:15,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:15,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:15,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:15,284 INFO L87 Difference]: Start difference. First operand 11908 states and 19229 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:17,372 INFO L93 Difference]: Finished difference Result 24936 states and 40142 transitions. [2024-11-08 16:37:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:37:17,373 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:37:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:17,433 INFO L225 Difference]: With dead ends: 24936 [2024-11-08 16:37:17,433 INFO L226 Difference]: Without dead ends: 15166 [2024-11-08 16:37:17,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:37:17,474 INFO L432 NwaCegarLoop]: 4217 mSDtfsCounter, 4877 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4894 SdHoareTripleChecker+Valid, 20864 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:17,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4894 Valid, 20864 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:37:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15166 states. [2024-11-08 16:37:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15166 to 11908. [2024-11-08 16:37:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11908 states, 11075 states have (on average 1.6000902934537247) internal successors, (17721), 11110 states have internal predecessors, (17721), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-08 16:37:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 19196 transitions. [2024-11-08 16:37:18,176 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 19196 transitions. Word has length 146 [2024-11-08 16:37:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:18,179 INFO L471 AbstractCegarLoop]: Abstraction has 11908 states and 19196 transitions. [2024-11-08 16:37:18,179 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 19196 transitions. [2024-11-08 16:37:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:37:18,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:18,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:18,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:37:18,194 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1880962170, now seen corresponding path program 1 times [2024-11-08 16:37:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:18,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569735826] [2024-11-08 16:37:18,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:18,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:18,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569735826] [2024-11-08 16:37:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569735826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:18,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753623928] [2024-11-08 16:37:18,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:18,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:18,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:18,421 INFO L87 Difference]: Start difference. First operand 11908 states and 19196 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:21,982 INFO L93 Difference]: Finished difference Result 37037 states and 59021 transitions. [2024-11-08 16:37:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:21,983 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:37:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:22,103 INFO L225 Difference]: With dead ends: 37037 [2024-11-08 16:37:22,104 INFO L226 Difference]: Without dead ends: 27267 [2024-11-08 16:37:22,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:22,149 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5211 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5227 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:22,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5227 Valid, 21934 Invalid, 2772 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 16:37:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27267 states. [2024-11-08 16:37:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27267 to 21446. [2024-11-08 16:37:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21446 states, 19813 states have (on average 1.5705344975521123) internal successors, (31117), 19880 states have internal predecessors, (31117), 1177 states have call successors, (1177), 391 states have call predecessors, (1177), 454 states have return successors, (1968), 1238 states have call predecessors, (1968), 1175 states have call successors, (1968) [2024-11-08 16:37:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21446 states to 21446 states and 34262 transitions. [2024-11-08 16:37:23,275 INFO L78 Accepts]: Start accepts. Automaton has 21446 states and 34262 transitions. Word has length 146 [2024-11-08 16:37:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:23,276 INFO L471 AbstractCegarLoop]: Abstraction has 21446 states and 34262 transitions. [2024-11-08 16:37:23,276 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 21446 states and 34262 transitions. [2024-11-08 16:37:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:37:23,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:23,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:23,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:37:23,291 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:23,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash 38486456, now seen corresponding path program 1 times [2024-11-08 16:37:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:23,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306159049] [2024-11-08 16:37:23,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:23,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:23,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:23,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:23,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306159049] [2024-11-08 16:37:23,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306159049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:23,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:23,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:23,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655181905] [2024-11-08 16:37:23,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:23,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:23,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:23,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:23,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:23,513 INFO L87 Difference]: Start difference. First operand 21446 states and 34262 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:27,922 INFO L93 Difference]: Finished difference Result 71117 states and 113589 transitions. [2024-11-08 16:37:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:37:27,923 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:37:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:28,150 INFO L225 Difference]: With dead ends: 71117 [2024-11-08 16:37:28,150 INFO L226 Difference]: Without dead ends: 51809 [2024-11-08 16:37:28,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:37:28,226 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5216 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5232 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:28,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5232 Valid, 21934 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:37:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2024-11-08 16:37:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 40583. [2024-11-08 16:37:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40583 states, 37350 states have (on average 1.55285140562249) internal successors, (57999), 37481 states have internal predecessors, (57999), 2329 states have call successors, (2329), 775 states have call predecessors, (2329), 902 states have return successors, (4642), 2454 states have call predecessors, (4642), 2327 states have call successors, (4642) [2024-11-08 16:37:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40583 states to 40583 states and 64970 transitions. [2024-11-08 16:37:30,467 INFO L78 Accepts]: Start accepts. Automaton has 40583 states and 64970 transitions. Word has length 146 [2024-11-08 16:37:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:30,468 INFO L471 AbstractCegarLoop]: Abstraction has 40583 states and 64970 transitions. [2024-11-08 16:37:30,468 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 40583 states and 64970 transitions. [2024-11-08 16:37:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:37:30,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:30,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:37:30,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:30,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1683516230, now seen corresponding path program 1 times [2024-11-08 16:37:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197102061] [2024-11-08 16:37:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:30,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:30,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:30,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:30,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197102061] [2024-11-08 16:37:30,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197102061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:30,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:30,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:30,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869977033] [2024-11-08 16:37:30,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:30,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:30,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:30,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:30,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:30,707 INFO L87 Difference]: Start difference. First operand 40583 states and 64970 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:38,504 INFO L93 Difference]: Finished difference Result 154890 states and 248505 transitions. [2024-11-08 16:37:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:37:38,504 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-08 16:37:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:39,255 INFO L225 Difference]: With dead ends: 154890 [2024-11-08 16:37:39,255 INFO L226 Difference]: Without dead ends: 116445 [2024-11-08 16:37:39,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:37:39,356 INFO L432 NwaCegarLoop]: 4438 mSDtfsCounter, 5293 mSDsluCounter, 17482 mSDsCounter, 0 mSdLazyCounter, 3212 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5308 SdHoareTripleChecker+Valid, 21920 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:39,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5308 Valid, 21920 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3212 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 16:37:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116445 states. [2024-11-08 16:37:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116445 to 77449. [2024-11-08 16:37:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77449 states, 71144 states have (on average 1.541254357359721) internal successors, (109651), 71403 states have internal predecessors, (109651), 4505 states have call successors, (4505), 1543 states have call predecessors, (4505), 1798 states have return successors, (11320), 4758 states have call predecessors, (11320), 4503 states have call successors, (11320) [2024-11-08 16:37:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77449 states to 77449 states and 125476 transitions. [2024-11-08 16:37:44,448 INFO L78 Accepts]: Start accepts. Automaton has 77449 states and 125476 transitions. Word has length 146 [2024-11-08 16:37:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:44,449 INFO L471 AbstractCegarLoop]: Abstraction has 77449 states and 125476 transitions. [2024-11-08 16:37:44,449 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:37:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 77449 states and 125476 transitions. [2024-11-08 16:37:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:37:44,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:44,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:44,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:37:44,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:44,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash 245415996, now seen corresponding path program 1 times [2024-11-08 16:37:44,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:44,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662009493] [2024-11-08 16:37:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:37:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:37:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 16:37:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:45,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 16:37:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:37:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662009493] [2024-11-08 16:37:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662009493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:37:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555222500] [2024-11-08 16:37:45,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:45,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:37:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:45,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:37:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:37:45,091 INFO L87 Difference]: Start difference. First operand 77449 states and 125476 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)