./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_label48+token_ring.10.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 a7e5f5a1db53b7a411af936e12a734750394ab6a9f7be60b4c793a1fb07a048c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:19:27,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:19:27,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:19:27,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:19:27,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:19:27,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:19:27,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:19:27,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:19:27,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:19:27,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:19:27,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:19:27,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:19:27,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:19:27,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:19:27,943 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:19:27,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:19:27,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:19:27,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:19:27,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:19:27,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:19:27,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:19:27,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:19:27,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:19:27,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:19:27,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:19:27,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:19:27,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:19:27,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:19:27,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:19:27,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:19:27,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:19:27,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:19:27,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:19:27,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:19:27,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:19:27,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:19:27,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:19:27,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:19:27,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:19:27,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:19:27,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:19:27,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:19:27,958 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 -> a7e5f5a1db53b7a411af936e12a734750394ab6a9f7be60b4c793a1fb07a048c [2024-11-11 22:19:28,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:19:28,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:19:28,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:19:28,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:19:28,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:19:28,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.10.cil-2.c [2024-11-11 22:19:29,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:19:30,302 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:19:30,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.10.cil-2.c [2024-11-11 22:19:30,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae7bba8c/0f93c4c38d254d88adb627012096e71b/FLAG4d522b43d [2024-11-11 22:19:30,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae7bba8c/0f93c4c38d254d88adb627012096e71b [2024-11-11 22:19:30,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:19:30,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:19:30,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:19:30,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:19:30,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:19:30,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:19:30" (1/1) ... [2024-11-11 22:19:30,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46787021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:30, skipping insertion in model container [2024-11-11 22:19:30,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:19:30" (1/1) ... [2024-11-11 22:19:30,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:19:32,315 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_label48+token_ring.10.cil-2.c[375709,375722] [2024-11-11 22:19:32,353 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_label48+token_ring.10.cil-2.c[383339,383352] [2024-11-11 22:19:32,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:19:32,660 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:19:33,478 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_label48+token_ring.10.cil-2.c[375709,375722] [2024-11-11 22:19:33,490 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_label48+token_ring.10.cil-2.c[383339,383352] [2024-11-11 22:19:33,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:19:33,623 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:19:33,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33 WrapperNode [2024-11-11 22:19:33,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:19:33,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:19:33,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:19:33,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:19:33,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:33,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,025 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13113 [2024-11-11 22:19:34,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:19:34,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:19:34,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:19:34,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:19:34,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,270 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-11 22:19:34,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:19:34,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:19:34,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:19:34,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:19:34,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (1/1) ... [2024-11-11 22:19:34,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:19:34,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:19:34,865 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-11 22:19:34,881 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-11 22:19:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:19:34,976 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:19:34,976 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:19:34,977 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:19:34,978 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:19:34,978 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:19:34,979 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:19:34,979 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:19:34,979 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:19:34,979 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:19:34,979 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:19:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:19:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:19:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:19:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:19:34,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:19:35,132 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:19:35,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:19:42,656 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2024-11-11 22:19:42,657 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:19:42,721 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:19:42,722 INFO L316 CfgBuilder]: Removed 14 assume(true) statements. [2024-11-11 22:19:42,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:19:42 BoogieIcfgContainer [2024-11-11 22:19:42,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:19:42,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:19:42,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:19:42,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:19:42,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:19:30" (1/3) ... [2024-11-11 22:19:42,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2b960f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:19:42, skipping insertion in model container [2024-11-11 22:19:42,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:19:33" (2/3) ... [2024-11-11 22:19:42,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2b960f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:19:42, skipping insertion in model container [2024-11-11 22:19:42,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:19:42" (3/3) ... [2024-11-11 22:19:42,731 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.10.cil-2.c [2024-11-11 22:19:42,748 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:19:42,748 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:19:42,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:19:42,877 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;@5d6fe46c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:19:42,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:19:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 2526 states, 2493 states have (on average 1.8419574809466506) internal successors, (4592), 2496 states have internal predecessors, (4592), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 22:19:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:19:42,912 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:19:42,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:19:42,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:19:42,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:19:42,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2034921809, now seen corresponding path program 1 times [2024-11-11 22:19:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:19:42,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763848524] [2024-11-11 22:19:42,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:19:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:19:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:19:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:19:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:43,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:19:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:43,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:19:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:19:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:43,622 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-11 22:19:43,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:19:43,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763848524] [2024-11-11 22:19:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763848524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:19:43,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:19:43,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:19:43,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288143987] [2024-11-11 22:19:43,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:19:43,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:19:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:19:43,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:19:43,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:19:43,666 INFO L87 Difference]: Start difference. First operand has 2526 states, 2493 states have (on average 1.8419574809466506) internal successors, (4592), 2496 states have internal predecessors, (4592), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:19:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:19:45,564 INFO L93 Difference]: Finished difference Result 5162 states and 9468 transitions. [2024-11-11 22:19:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:19:45,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:19:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:19:45,595 INFO L225 Difference]: With dead ends: 5162 [2024-11-11 22:19:45,595 INFO L226 Difference]: Without dead ends: 2579 [2024-11-11 22:19:45,609 INFO L434 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-11 22:19:45,612 INFO L435 NwaCegarLoop]: 4337 mSDtfsCounter, 899 mSDsluCounter, 12435 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:19:45,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 16772 Invalid, 931 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:19:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2024-11-11 22:19:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2459. [2024-11-11 22:19:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2427 states have (on average 1.826534816646065) internal successors, (4433), 2429 states have internal predecessors, (4433), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 22:19:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4481 transitions. [2024-11-11 22:19:45,785 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4481 transitions. Word has length 156 [2024-11-11 22:19:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:19:45,786 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 4481 transitions. [2024-11-11 22:19:45,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:19:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4481 transitions. [2024-11-11 22:19:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:19:45,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:19:45,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:19:45,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:19:45,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:19:45,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:19:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1833490989, now seen corresponding path program 1 times [2024-11-11 22:19:45,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:19:45,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079852540] [2024-11-11 22:19:45,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:19:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:19:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:19:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:46,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:19:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:19:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:46,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:19:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:46,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:19:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:46,234 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-11 22:19:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:19:46,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079852540] [2024-11-11 22:19:46,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079852540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:19:46,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:19:46,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:19:46,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082618811] [2024-11-11 22:19:46,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:19:46,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:19:46,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:19:46,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:19:46,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:19:46,242 INFO L87 Difference]: Start difference. First operand 2459 states and 4481 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:19:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:19:49,901 INFO L93 Difference]: Finished difference Result 3374 states and 5955 transitions. [2024-11-11 22:19:49,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:19:49,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:19:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:19:49,920 INFO L225 Difference]: With dead ends: 3374 [2024-11-11 22:19:49,921 INFO L226 Difference]: Without dead ends: 3054 [2024-11-11 22:19:49,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:19:49,925 INFO L435 NwaCegarLoop]: 4460 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3167 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22009 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:19:49,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22009 Invalid, 3229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 3167 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 22:19:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2024-11-11 22:19:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2797. [2024-11-11 22:19:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2736 states have (on average 1.7978801169590644) internal successors, (4919), 2740 states have internal predecessors, (4919), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-11-11 22:19:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 5016 transitions. [2024-11-11 22:19:50,068 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 5016 transitions. Word has length 156 [2024-11-11 22:19:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:19:50,068 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 5016 transitions. [2024-11-11 22:19:50,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:19:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 5016 transitions. [2024-11-11 22:19:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:19:50,072 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:19:50,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:19:50,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:19:50,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:19:50,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:19:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash 216050539, now seen corresponding path program 1 times [2024-11-11 22:19:50,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:19:50,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403115687] [2024-11-11 22:19:50,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:19:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:19:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:19:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:50,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:19:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:50,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:19:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:50,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:19:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:19:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:50,457 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-11 22:19:50,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:19:50,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403115687] [2024-11-11 22:19:50,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403115687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:19:50,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:19:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:19:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772123120] [2024-11-11 22:19:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:19:50,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:19:50,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:19:50,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:19:50,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:19:50,464 INFO L87 Difference]: Start difference. First operand 2797 states and 5016 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:19:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:19:53,691 INFO L93 Difference]: Finished difference Result 4542 states and 7800 transitions. [2024-11-11 22:19:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:19:53,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:19:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:19:53,709 INFO L225 Difference]: With dead ends: 4542 [2024-11-11 22:19:53,709 INFO L226 Difference]: Without dead ends: 3886 [2024-11-11 22:19:53,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:19:53,714 INFO L435 NwaCegarLoop]: 4406 mSDtfsCounter, 5285 mSDsluCounter, 17474 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5302 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:19:53,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5302 Valid, 21880 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:19:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2024-11-11 22:19:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3421. [2024-11-11 22:19:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3308 states have (on average 1.7533252720677146) internal successors, (5800), 3314 states have internal predecessors, (5800), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-11-11 22:19:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 5983 transitions. [2024-11-11 22:19:53,849 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 5983 transitions. Word has length 156 [2024-11-11 22:19:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:19:53,850 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 5983 transitions. [2024-11-11 22:19:53,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:19:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 5983 transitions. [2024-11-11 22:19:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:19:53,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:19:53,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:19:53,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:19:53,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:19:53,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:19:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash 579517037, now seen corresponding path program 1 times [2024-11-11 22:19:53,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:19:53,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47940061] [2024-11-11 22:19:53,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:19:53,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:19:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:54,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:19:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:19:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:19:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:19:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:19:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:54,174 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-11 22:19:54,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:19:54,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47940061] [2024-11-11 22:19:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47940061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:19:54,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:19:54,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:19:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405267235] [2024-11-11 22:19:54,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:19:54,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:19:54,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:19:54,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:19:54,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:19:54,178 INFO L87 Difference]: Start difference. First operand 3421 states and 5983 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:19:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:19:57,119 INFO L93 Difference]: Finished difference Result 6828 states and 11399 transitions. [2024-11-11 22:19:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:19:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:19:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:19:57,143 INFO L225 Difference]: With dead ends: 6828 [2024-11-11 22:19:57,143 INFO L226 Difference]: Without dead ends: 5548 [2024-11-11 22:19:57,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:19:57,152 INFO L435 NwaCegarLoop]: 4458 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3162 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22007 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:19:57,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22007 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3162 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:19:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2024-11-11 22:19:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 4671. [2024-11-11 22:19:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4671 states, 4454 states have (on average 1.698248765154917) internal successors, (7564), 4464 states have internal predecessors, (7564), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-11-11 22:19:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 7925 transitions. [2024-11-11 22:19:57,441 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 7925 transitions. Word has length 156 [2024-11-11 22:19:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:19:57,441 INFO L471 AbstractCegarLoop]: Abstraction has 4671 states and 7925 transitions. [2024-11-11 22:19:57,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:19:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 7925 transitions. [2024-11-11 22:19:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:19:57,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:19:57,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:19:57,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:19:57,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:19:57,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:19:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 868336427, now seen corresponding path program 1 times [2024-11-11 22:19:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:19:57,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442669461] [2024-11-11 22:19:57,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:19:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:19:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:57,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:19:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:57,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:19:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:57,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:19:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:19:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:57,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:19:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:19:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:19:57,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:19:57,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442669461] [2024-11-11 22:19:57,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442669461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:19:57,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:19:57,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:19:57,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417331636] [2024-11-11 22:19:57,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:19:57,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:19:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:19:57,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:19:57,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:19:57,727 INFO L87 Difference]: Start difference. First operand 4671 states and 7925 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:00,929 INFO L93 Difference]: Finished difference Result 11398 states and 18611 transitions. [2024-11-11 22:20:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:00,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:20:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:00,971 INFO L225 Difference]: With dead ends: 11398 [2024-11-11 22:20:00,971 INFO L226 Difference]: Without dead ends: 8868 [2024-11-11 22:20:00,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:00,985 INFO L435 NwaCegarLoop]: 4456 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3143 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22005 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:00,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22005 Invalid, 3207 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3143 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 22:20:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8868 states. [2024-11-11 22:20:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8868 to 7177. [2024-11-11 22:20:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 6752 states have (on average 1.643957345971564) internal successors, (11100), 6770 states have internal predecessors, (11100), 311 states have call successors, (311), 96 states have call predecessors, (311), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-11-11 22:20:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 11835 transitions. [2024-11-11 22:20:01,465 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 11835 transitions. Word has length 156 [2024-11-11 22:20:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:01,465 INFO L471 AbstractCegarLoop]: Abstraction has 7177 states and 11835 transitions. [2024-11-11 22:20:01,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 11835 transitions. [2024-11-11 22:20:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:20:01,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:01,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:20:01,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:20:01,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:01,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:01,473 INFO L85 PathProgramCache]: Analyzing trace with hash 323463853, now seen corresponding path program 1 times [2024-11-11 22:20:01,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:01,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808066036] [2024-11-11 22:20:01,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:01,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:20:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:20:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:20:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:01,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:20:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:01,795 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-11 22:20:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808066036] [2024-11-11 22:20:01,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808066036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:01,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:01,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042063216] [2024-11-11 22:20:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:01,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:01,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:01,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:01,799 INFO L87 Difference]: Start difference. First operand 7177 states and 11835 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:05,400 INFO L93 Difference]: Finished difference Result 20536 states and 33091 transitions. [2024-11-11 22:20:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:05,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:20:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:05,461 INFO L225 Difference]: With dead ends: 20536 [2024-11-11 22:20:05,462 INFO L226 Difference]: Without dead ends: 15500 [2024-11-11 22:20:05,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:05,490 INFO L435 NwaCegarLoop]: 4459 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22008 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:05,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22008 Invalid, 3213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:20:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15500 states. [2024-11-11 22:20:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15500 to 12203. [2024-11-11 22:20:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12203 states, 11362 states have (on average 1.6011265622249604) internal successors, (18192), 11396 states have internal predecessors, (18192), 615 states have call successors, (615), 192 states have call predecessors, (615), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-11-11 22:20:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 19729 transitions. [2024-11-11 22:20:06,122 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 19729 transitions. Word has length 156 [2024-11-11 22:20:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:06,123 INFO L471 AbstractCegarLoop]: Abstraction has 12203 states and 19729 transitions. [2024-11-11 22:20:06,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 19729 transitions. [2024-11-11 22:20:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:20:06,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:06,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:20:06,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:20:06,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash 998623979, now seen corresponding path program 1 times [2024-11-11 22:20:06,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726135778] [2024-11-11 22:20:06,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:06,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:20:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:20:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:06,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:20:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:20:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:06,392 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-11 22:20:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726135778] [2024-11-11 22:20:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726135778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:06,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47840784] [2024-11-11 22:20:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:06,394 INFO L87 Difference]: Start difference. First operand 12203 states and 19729 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:09,988 INFO L93 Difference]: Finished difference Result 38810 states and 62239 transitions. [2024-11-11 22:20:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:09,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:20:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:10,112 INFO L225 Difference]: With dead ends: 38810 [2024-11-11 22:20:10,113 INFO L226 Difference]: Without dead ends: 28748 [2024-11-11 22:20:10,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:10,173 INFO L435 NwaCegarLoop]: 4458 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22007 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:10,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22007 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:20:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28748 states. [2024-11-11 22:20:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28748 to 22285. [2024-11-11 22:20:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22285 states, 20612 states have (on average 1.5728701727149232) internal successors, (32420), 20678 states have internal predecessors, (32420), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 448 states have return successors, (2080), 1286 states have call predecessors, (2080), 1223 states have call successors, (2080) [2024-11-11 22:20:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22285 states to 22285 states and 35723 transitions. [2024-11-11 22:20:11,503 INFO L78 Accepts]: Start accepts. Automaton has 22285 states and 35723 transitions. Word has length 156 [2024-11-11 22:20:11,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:11,504 INFO L471 AbstractCegarLoop]: Abstraction has 22285 states and 35723 transitions. [2024-11-11 22:20:11,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 22285 states and 35723 transitions. [2024-11-11 22:20:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:20:11,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:11,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:20:11,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:20:11,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:11,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash 50572013, now seen corresponding path program 1 times [2024-11-11 22:20:11,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:11,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193285406] [2024-11-11 22:20:11,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:11,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:11,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:20:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:20:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:20:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:20:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:11,806 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-11 22:20:11,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193285406] [2024-11-11 22:20:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193285406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:11,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059356117] [2024-11-11 22:20:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:11,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:11,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:11,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:11,809 INFO L87 Difference]: Start difference. First operand 22285 states and 35723 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:14,342 INFO L93 Difference]: Finished difference Result 49349 states and 79788 transitions. [2024-11-11 22:20:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:20:14,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:20:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:14,481 INFO L225 Difference]: With dead ends: 49349 [2024-11-11 22:20:14,481 INFO L226 Difference]: Without dead ends: 29203 [2024-11-11 22:20:14,543 INFO L434 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-11 22:20:14,544 INFO L435 NwaCegarLoop]: 4227 mSDtfsCounter, 5082 mSDsluCounter, 12542 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5100 SdHoareTripleChecker+Valid, 16769 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:14,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5100 Valid, 16769 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:20:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29203 states. [2024-11-11 22:20:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29203 to 22285. [2024-11-11 22:20:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22285 states, 20612 states have (on average 1.5697166699010285) internal successors, (32355), 20678 states have internal predecessors, (32355), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 448 states have return successors, (2080), 1286 states have call predecessors, (2080), 1223 states have call successors, (2080) [2024-11-11 22:20:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22285 states to 22285 states and 35658 transitions. [2024-11-11 22:20:15,680 INFO L78 Accepts]: Start accepts. Automaton has 22285 states and 35658 transitions. Word has length 156 [2024-11-11 22:20:15,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:15,680 INFO L471 AbstractCegarLoop]: Abstraction has 22285 states and 35658 transitions. [2024-11-11 22:20:15,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 22285 states and 35658 transitions. [2024-11-11 22:20:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:20:15,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:15,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:20:15,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:20:15,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:15,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash -534199637, now seen corresponding path program 1 times [2024-11-11 22:20:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:15,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13431885] [2024-11-11 22:20:15,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:15,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:20:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:15,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:20:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:15,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:20:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:20:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:15,931 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-11 22:20:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13431885] [2024-11-11 22:20:15,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13431885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:15,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:15,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212483605] [2024-11-11 22:20:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:15,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:15,933 INFO L87 Difference]: Start difference. First operand 22285 states and 35658 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:20,449 INFO L93 Difference]: Finished difference Result 75229 states and 120559 transitions. [2024-11-11 22:20:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:20,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:20:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:20,642 INFO L225 Difference]: With dead ends: 75229 [2024-11-11 22:20:20,642 INFO L226 Difference]: Without dead ends: 55085 [2024-11-11 22:20:20,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:20,710 INFO L435 NwaCegarLoop]: 4457 mSDtfsCounter, 5276 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3010 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5293 SdHoareTripleChecker+Valid, 22006 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:20,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5293 Valid, 22006 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3010 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:20:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55085 states. [2024-11-11 22:20:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55085 to 42638. [2024-11-11 22:20:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42638 states, 39301 states have (on average 1.5528866949950384) internal successors, (61030), 39431 states have internal predecessors, (61030), 2439 states have call successors, (2439), 768 states have call predecessors, (2439), 896 states have return successors, (4882), 2566 states have call predecessors, (4882), 2439 states have call successors, (4882) [2024-11-11 22:20:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42638 states to 42638 states and 68351 transitions. [2024-11-11 22:20:23,477 INFO L78 Accepts]: Start accepts. Automaton has 42638 states and 68351 transitions. Word has length 156 [2024-11-11 22:20:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:23,477 INFO L471 AbstractCegarLoop]: Abstraction has 42638 states and 68351 transitions. [2024-11-11 22:20:23,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 42638 states and 68351 transitions. [2024-11-11 22:20:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:20:23,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:23,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:20:23,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:20:23,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:23,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash -963857943, now seen corresponding path program 1 times [2024-11-11 22:20:23,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390938075] [2024-11-11 22:20:23,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:23,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:20:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:23,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:20:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:23,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:20:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:20:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:23,840 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-11 22:20:23,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:23,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390938075] [2024-11-11 22:20:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390938075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:23,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:23,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643071830] [2024-11-11 22:20:23,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:23,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:23,842 INFO L87 Difference]: Start difference. First operand 42638 states and 68351 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:30,550 INFO L93 Difference]: Finished difference Result 148320 states and 239808 transitions. [2024-11-11 22:20:30,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:30,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-11 22:20:30,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:31,185 INFO L225 Difference]: With dead ends: 148320 [2024-11-11 22:20:31,185 INFO L226 Difference]: Without dead ends: 107823 [2024-11-11 22:20:31,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:31,274 INFO L435 NwaCegarLoop]: 4407 mSDtfsCounter, 5302 mSDsluCounter, 17474 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5319 SdHoareTripleChecker+Valid, 21881 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:31,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5319 Valid, 21881 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 22:20:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107823 states. [2024-11-11 22:20:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107823 to 83472. [2024-11-11 22:20:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83472 states, 76807 states have (on average 1.5437655422031846) internal successors, (118572), 77065 states have internal predecessors, (118572), 4871 states have call successors, (4871), 1536 states have call predecessors, (4871), 1792 states have return successors, (11944), 5126 states have call predecessors, (11944), 4871 states have call successors, (11944) [2024-11-11 22:20:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83472 states to 83472 states and 135387 transitions. [2024-11-11 22:20:36,378 INFO L78 Accepts]: Start accepts. Automaton has 83472 states and 135387 transitions. Word has length 156 [2024-11-11 22:20:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:36,379 INFO L471 AbstractCegarLoop]: Abstraction has 83472 states and 135387 transitions. [2024-11-11 22:20:36,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 83472 states and 135387 transitions. [2024-11-11 22:20:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 22:20:36,437 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:36,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:20:36,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:20:36,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:36,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:36,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1670454549, now seen corresponding path program 1 times [2024-11-11 22:20:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:36,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831820364] [2024-11-11 22:20:36,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:36,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:36,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 22:20:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:20:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:37,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 22:20:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:37,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 22:20:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:37,014 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-11 22:20:37,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831820364] [2024-11-11 22:20:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831820364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:37,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:37,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292267963] [2024-11-11 22:20:37,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:37,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:37,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:37,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:37,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:37,017 INFO L87 Difference]: Start difference. First operand 83472 states and 135387 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)