./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.12.cil.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 062c7418109a213aa13d25a99437d8241cca4f6492c123259890838dc94aff90 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:31:40,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:31:40,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:31:40,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:31:40,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:31:40,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:31:40,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:31:40,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:31:40,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:31:40,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:31:40,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:31:40,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:31:40,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:31:40,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:31:40,935 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:31:40,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:31:40,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:31:40,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:31:40,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:31:40,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:31:40,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:31:40,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:31:40,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:31:40,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:31:40,938 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:31:40,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:31:40,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:31:40,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:31:40,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:31:40,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:31:40,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:31:40,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:31:40,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:31:40,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:31:40,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:31:40,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:31:40,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:31:40,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:31:40,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:31:40,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:31:40,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:31:40,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:31:40,944 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 -> 062c7418109a213aa13d25a99437d8241cca4f6492c123259890838dc94aff90 [2024-11-08 15:31:41,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:31:41,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:31:41,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:31:41,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:31:41,230 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:31:41,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.12.cil.c [2024-11-08 15:31:42,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:31:42,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:31:42,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.12.cil.c [2024-11-08 15:31:42,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774586add/2689ede157704b68a5dd2de2efd5bdf3/FLAGbb59b9a18 [2024-11-08 15:31:42,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774586add/2689ede157704b68a5dd2de2efd5bdf3 [2024-11-08 15:31:42,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:31:42,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:31:42,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:31:42,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:31:42,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:31:42,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:31:42" (1/1) ... [2024-11-08 15:31:42,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ccd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:42, skipping insertion in model container [2024-11-08 15:31:42,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:31:42" (1/1) ... [2024-11-08 15:31:43,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:31:43,208 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/systemc/transmitter.12.cil.c[706,719] [2024-11-08 15:31:43,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:31:43,358 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:31:43,367 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/systemc/transmitter.12.cil.c[706,719] [2024-11-08 15:31:43,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:31:43,484 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:31:43,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43 WrapperNode [2024-11-08 15:31:43,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:31:43,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:31:43,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:31:43,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:31:43,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,556 INFO L138 Inliner]: procedures = 52, calls = 66, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 859 [2024-11-08 15:31:43,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:31:43,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:31:43,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:31:43,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:31:43,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,604 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:31:43,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:31:43,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:31:43,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:31:43,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:31:43,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (1/1) ... [2024-11-08 15:31:43,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:31:43,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:31:43,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:31:43,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:31:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:31:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-08 15:31:43,764 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-08 15:31:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-08 15:31:43,765 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-08 15:31:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-08 15:31:43,765 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-08 15:31:43,765 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-08 15:31:43,766 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-08 15:31:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-08 15:31:43,767 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-08 15:31:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-08 15:31:43,767 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-08 15:31:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:31:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:31:43,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:31:43,923 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:31:43,926 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:31:44,903 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2024-11-08 15:31:44,904 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:31:44,930 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:31:44,932 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-08 15:31:44,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:31:44 BoogieIcfgContainer [2024-11-08 15:31:44,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:31:44,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:31:44,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:31:44,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:31:44,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:31:42" (1/3) ... [2024-11-08 15:31:44,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e678da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:31:44, skipping insertion in model container [2024-11-08 15:31:44,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:31:43" (2/3) ... [2024-11-08 15:31:44,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e678da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:31:44, skipping insertion in model container [2024-11-08 15:31:44,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:31:44" (3/3) ... [2024-11-08 15:31:44,940 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.12.cil.c [2024-11-08 15:31:44,955 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:31:44,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:31:45,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:31:45,029 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;@4d5a4f6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:31:45,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:31:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 358 states have (on average 1.6396648044692737) internal successors, (587), 360 states have internal predecessors, (587), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 15:31:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:31:45,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:31:45,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:31:45,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:31:45,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:31:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2143662792, now seen corresponding path program 1 times [2024-11-08 15:31:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:31:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209004993] [2024-11-08 15:31:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:31:45,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:31:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:45,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:31:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:45,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:31:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:31:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:31:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:45,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:31:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:31:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:31:45,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209004993] [2024-11-08 15:31:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209004993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:31:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:31:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:31:45,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196871454] [2024-11-08 15:31:45,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:31:45,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:31:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:31:45,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:31:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:31:45,902 INFO L87 Difference]: Start difference. First operand has 391 states, 358 states have (on average 1.6396648044692737) internal successors, (587), 360 states have internal predecessors, (587), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:31:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:31:48,093 INFO L93 Difference]: Finished difference Result 909 states and 1493 transitions. [2024-11-08 15:31:48,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:31:48,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 3 states have internal predecessors, (177), 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 187 [2024-11-08 15:31:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:31:48,118 INFO L225 Difference]: With dead ends: 909 [2024-11-08 15:31:48,120 INFO L226 Difference]: Without dead ends: 526 [2024-11-08 15:31:48,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:31:48,133 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1031 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:31:48,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 775 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 15:31:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-08 15:31:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 386. [2024-11-08 15:31:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 354 states have (on average 1.5480225988700564) internal successors, (548), 355 states have internal predecessors, (548), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 15:31:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 598 transitions. [2024-11-08 15:31:48,214 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 598 transitions. Word has length 187 [2024-11-08 15:31:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:31:48,215 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 598 transitions. [2024-11-08 15:31:48,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 3 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:31:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 598 transitions. [2024-11-08 15:31:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:31:48,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:31:48,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:31:48,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:31:48,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:31:48,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:31:48,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1320650870, now seen corresponding path program 1 times [2024-11-08 15:31:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:31:48,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917801176] [2024-11-08 15:31:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:31:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:31:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:31:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:31:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:31:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:31:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:48,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:31:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:31:48,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:31:48,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917801176] [2024-11-08 15:31:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917801176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:31:48,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:31:48,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:31:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284540199] [2024-11-08 15:31:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:31:48,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:31:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:31:48,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:31:48,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:31:48,663 INFO L87 Difference]: Start difference. First operand 386 states and 598 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:31:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:31:51,684 INFO L93 Difference]: Finished difference Result 1415 states and 2256 transitions. [2024-11-08 15:31:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:31:51,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 4 states have internal predecessors, (177), 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 187 [2024-11-08 15:31:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:31:51,691 INFO L225 Difference]: With dead ends: 1415 [2024-11-08 15:31:51,691 INFO L226 Difference]: Without dead ends: 1049 [2024-11-08 15:31:51,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:31:51,694 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1548 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:31:51,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 1309 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 15:31:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-11-08 15:31:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 769. [2024-11-08 15:31:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 710 states have (on average 1.5577464788732394) internal successors, (1106), 712 states have internal predecessors, (1106), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-11-08 15:31:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1199 transitions. [2024-11-08 15:31:51,780 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1199 transitions. Word has length 187 [2024-11-08 15:31:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:31:51,783 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1199 transitions. [2024-11-08 15:31:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:31:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1199 transitions. [2024-11-08 15:31:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:31:51,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:31:51,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:31:51,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:31:51,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:31:51,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:31:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 308761065, now seen corresponding path program 1 times [2024-11-08 15:31:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:31:51,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546914998] [2024-11-08 15:31:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:31:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:31:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:31:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:31:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:31:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:31:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:52,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:31:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:31:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:31:52,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546914998] [2024-11-08 15:31:52,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546914998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:31:52,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:31:52,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:31:52,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112307086] [2024-11-08 15:31:52,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:31:52,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:31:52,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:31:52,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:31:52,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:31:52,185 INFO L87 Difference]: Start difference. First operand 769 states and 1199 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:31:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:31:56,800 INFO L93 Difference]: Finished difference Result 2518 states and 3985 transitions. [2024-11-08 15:31:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:31:56,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2024-11-08 15:31:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:31:56,810 INFO L225 Difference]: With dead ends: 2518 [2024-11-08 15:31:56,810 INFO L226 Difference]: Without dead ends: 1769 [2024-11-08 15:31:56,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:31:56,815 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 1703 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 4517 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 4578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:31:56,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 2570 Invalid, 4578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4517 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 15:31:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2024-11-08 15:31:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1126. [2024-11-08 15:31:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1040 states have (on average 1.55) internal successors, (1612), 1043 states have internal predecessors, (1612), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-11-08 15:31:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1747 transitions. [2024-11-08 15:31:56,890 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1747 transitions. Word has length 187 [2024-11-08 15:31:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:31:56,891 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1747 transitions. [2024-11-08 15:31:56,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:31:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1747 transitions. [2024-11-08 15:31:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:31:56,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:31:56,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:31:56,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:31:56,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:31:56,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:31:56,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1415847257, now seen corresponding path program 1 times [2024-11-08 15:31:56,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:31:56,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239113593] [2024-11-08 15:31:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:31:56,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:31:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:57,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:31:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:57,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:31:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:31:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:31:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:31:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:31:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:31:57,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:31:57,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239113593] [2024-11-08 15:31:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239113593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:31:57,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:31:57,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:31:57,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623781926] [2024-11-08 15:31:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:31:57,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:31:57,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:31:57,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:31:57,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:31:57,259 INFO L87 Difference]: Start difference. First operand 1126 states and 1747 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:01,394 INFO L93 Difference]: Finished difference Result 3883 states and 6133 transitions. [2024-11-08 15:32:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:32:01,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2024-11-08 15:32:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:01,411 INFO L225 Difference]: With dead ends: 3883 [2024-11-08 15:32:01,411 INFO L226 Difference]: Without dead ends: 2777 [2024-11-08 15:32:01,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:32:01,416 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1701 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 4513 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 4576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:01,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 2568 Invalid, 4576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4513 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 15:32:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2024-11-08 15:32:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 1841. [2024-11-08 15:32:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1701 states have (on average 1.5432098765432098) internal successors, (2625), 1706 states have internal predecessors, (2625), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-11-08 15:32:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2848 transitions. [2024-11-08 15:32:01,541 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2848 transitions. Word has length 187 [2024-11-08 15:32:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:01,541 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2848 transitions. [2024-11-08 15:32:01,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2848 transitions. [2024-11-08 15:32:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:32:01,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:01,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:01,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:32:01,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:01,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash -917290455, now seen corresponding path program 1 times [2024-11-08 15:32:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:01,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650125792] [2024-11-08 15:32:01,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:01,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:01,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:01,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:32:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:01,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:01,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:32:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:01,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:32:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:01,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650125792] [2024-11-08 15:32:01,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650125792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:01,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:01,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:01,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382429100] [2024-11-08 15:32:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:01,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:01,913 INFO L87 Difference]: Start difference. First operand 1841 states and 2848 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:06,002 INFO L93 Difference]: Finished difference Result 6512 states and 10242 transitions. [2024-11-08 15:32:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:32:06,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2024-11-08 15:32:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:06,024 INFO L225 Difference]: With dead ends: 6512 [2024-11-08 15:32:06,024 INFO L226 Difference]: Without dead ends: 4691 [2024-11-08 15:32:06,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:32:06,032 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1818 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 3985 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 4082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:06,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 1645 Invalid, 4082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3985 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 15:32:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2024-11-08 15:32:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 3272. [2024-11-08 15:32:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 3024 states have (on average 1.5380291005291005) internal successors, (4651), 3033 states have internal predecessors, (4651), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-11-08 15:32:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 5056 transitions. [2024-11-08 15:32:06,265 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 5056 transitions. Word has length 187 [2024-11-08 15:32:06,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:06,265 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 5056 transitions. [2024-11-08 15:32:06,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 5056 transitions. [2024-11-08 15:32:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:32:06,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:06,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:06,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:32:06,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:06,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:06,273 INFO L85 PathProgramCache]: Analyzing trace with hash -347018649, now seen corresponding path program 1 times [2024-11-08 15:32:06,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:06,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675920774] [2024-11-08 15:32:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:06,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:32:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:06,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:32:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:32:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:06,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675920774] [2024-11-08 15:32:06,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675920774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:06,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:06,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:06,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033214708] [2024-11-08 15:32:06,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:06,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:06,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:06,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:06,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:06,626 INFO L87 Difference]: Start difference. First operand 3272 states and 5056 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:11,033 INFO L93 Difference]: Finished difference Result 11762 states and 18464 transitions. [2024-11-08 15:32:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:32:11,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2024-11-08 15:32:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:11,070 INFO L225 Difference]: With dead ends: 11762 [2024-11-08 15:32:11,070 INFO L226 Difference]: Without dead ends: 8510 [2024-11-08 15:32:11,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:32:11,081 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1699 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 4471 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 4534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:11,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 2568 Invalid, 4534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4471 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 15:32:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2024-11-08 15:32:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 6148. [2024-11-08 15:32:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6148 states, 5684 states have (on average 1.535362420830401) internal successors, (8727), 5701 states have internal predecessors, (8727), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-11-08 15:32:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 9514 transitions. [2024-11-08 15:32:11,461 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 9514 transitions. Word has length 187 [2024-11-08 15:32:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:11,461 INFO L471 AbstractCegarLoop]: Abstraction has 6148 states and 9514 transitions. [2024-11-08 15:32:11,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 9514 transitions. [2024-11-08 15:32:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:32:11,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:11,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:11,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:32:11,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:11,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1133016539, now seen corresponding path program 1 times [2024-11-08 15:32:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:11,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421110889] [2024-11-08 15:32:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:11,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:32:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:11,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:32:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:11,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:32:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:11,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:11,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421110889] [2024-11-08 15:32:11,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421110889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:11,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:11,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732482366] [2024-11-08 15:32:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:11,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:11,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:11,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:11,736 INFO L87 Difference]: Start difference. First operand 6148 states and 9514 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:16,162 INFO L93 Difference]: Finished difference Result 22280 states and 35000 transitions. [2024-11-08 15:32:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:32:16,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2024-11-08 15:32:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:16,237 INFO L225 Difference]: With dead ends: 22280 [2024-11-08 15:32:16,239 INFO L226 Difference]: Without dead ends: 16152 [2024-11-08 15:32:16,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:32:16,262 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1698 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 4458 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 4521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:16,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 2568 Invalid, 4521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4458 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 15:32:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16152 states. [2024-11-08 15:32:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16152 to 11913. [2024-11-08 15:32:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11913 states, 11017 states have (on average 1.533720613597168) internal successors, (16897), 11050 states have internal predecessors, (16897), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-08 15:32:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11913 states to 11913 states and 18502 transitions. [2024-11-08 15:32:17,080 INFO L78 Accepts]: Start accepts. Automaton has 11913 states and 18502 transitions. Word has length 187 [2024-11-08 15:32:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:17,080 INFO L471 AbstractCegarLoop]: Abstraction has 11913 states and 18502 transitions. [2024-11-08 15:32:17,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 11913 states and 18502 transitions. [2024-11-08 15:32:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:32:17,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:17,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:17,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:32:17,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:17,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash -465634649, now seen corresponding path program 1 times [2024-11-08 15:32:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:17,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254727286] [2024-11-08 15:32:17,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:32:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:32:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:32:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:17,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:17,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254727286] [2024-11-08 15:32:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254727286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473534650] [2024-11-08 15:32:17,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:17,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:17,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:17,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:17,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:17,412 INFO L87 Difference]: Start difference. First operand 11913 states and 18502 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:19,751 INFO L93 Difference]: Finished difference Result 28104 states and 44390 transitions. [2024-11-08 15:32:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:32:19,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2024-11-08 15:32:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:19,816 INFO L225 Difference]: With dead ends: 28104 [2024-11-08 15:32:19,816 INFO L226 Difference]: Without dead ends: 16211 [2024-11-08 15:32:19,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:32:19,851 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1137 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:19,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 1282 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 15:32:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16211 states. [2024-11-08 15:32:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16211 to 11913. [2024-11-08 15:32:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11913 states, 11017 states have (on average 1.5307252428065716) internal successors, (16864), 11050 states have internal predecessors, (16864), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-08 15:32:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11913 states to 11913 states and 18469 transitions. [2024-11-08 15:32:20,521 INFO L78 Accepts]: Start accepts. Automaton has 11913 states and 18469 transitions. Word has length 187 [2024-11-08 15:32:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:20,522 INFO L471 AbstractCegarLoop]: Abstraction has 11913 states and 18469 transitions. [2024-11-08 15:32:20,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 11913 states and 18469 transitions. [2024-11-08 15:32:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:32:20,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:20,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:20,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:32:20,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:20,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1634103781, now seen corresponding path program 1 times [2024-11-08 15:32:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:20,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335639637] [2024-11-08 15:32:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:32:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:32:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:32:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:20,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:20,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335639637] [2024-11-08 15:32:20,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335639637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:20,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:20,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:20,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404496705] [2024-11-08 15:32:20,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:20,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:20,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:20,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:20,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:20,794 INFO L87 Difference]: Start difference. First operand 11913 states and 18469 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:25,993 INFO L93 Difference]: Finished difference Result 43281 states and 68030 transitions. [2024-11-08 15:32:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:32:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2024-11-08 15:32:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:26,105 INFO L225 Difference]: With dead ends: 43281 [2024-11-08 15:32:26,105 INFO L226 Difference]: Without dead ends: 31388 [2024-11-08 15:32:26,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:32:26,137 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1690 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 4420 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 4483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:26,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 2568 Invalid, 4483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4420 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 15:32:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31388 states. [2024-11-08 15:32:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31388 to 23507. [2024-11-08 15:32:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23507 states, 21747 states have (on average 1.5290384880673196) internal successors, (33252), 21812 states have internal predecessors, (33252), 1305 states have call successors, (1305), 390 states have call predecessors, (1305), 454 states have return successors, (2098), 1368 states have call predecessors, (2098), 1305 states have call successors, (2098) [2024-11-08 15:32:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23507 states to 23507 states and 36655 transitions. [2024-11-08 15:32:27,332 INFO L78 Accepts]: Start accepts. Automaton has 23507 states and 36655 transitions. Word has length 187 [2024-11-08 15:32:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:27,332 INFO L471 AbstractCegarLoop]: Abstraction has 23507 states and 36655 transitions. [2024-11-08 15:32:27,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 23507 states and 36655 transitions. [2024-11-08 15:32:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:32:27,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:27,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:27,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:32:27,374 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:27,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1978931943, now seen corresponding path program 1 times [2024-11-08 15:32:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:27,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30453140] [2024-11-08 15:32:27,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:32:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:32:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:32:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:27,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:27,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30453140] [2024-11-08 15:32:27,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30453140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:27,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:27,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:27,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877430226] [2024-11-08 15:32:27,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:27,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:27,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:27,665 INFO L87 Difference]: Start difference. First operand 23507 states and 36655 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:34,201 INFO L93 Difference]: Finished difference Result 85353 states and 134966 transitions. [2024-11-08 15:32:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:32:34,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2024-11-08 15:32:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:34,437 INFO L225 Difference]: With dead ends: 85353 [2024-11-08 15:32:34,437 INFO L226 Difference]: Without dead ends: 61866 [2024-11-08 15:32:34,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:32:34,501 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1689 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 4407 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 4470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:34,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 2568 Invalid, 4470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4407 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 15:32:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61866 states. [2024-11-08 15:32:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61866 to 46756. [2024-11-08 15:32:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46756 states, 43268 states have (on average 1.5281039105112324) internal successors, (66118), 43397 states have internal predecessors, (66118), 2585 states have call successors, (2585), 774 states have call predecessors, (2585), 902 states have return successors, (4900), 2712 states have call predecessors, (4900), 2585 states have call successors, (4900) [2024-11-08 15:32:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46756 states to 46756 states and 73603 transitions. [2024-11-08 15:32:37,623 INFO L78 Accepts]: Start accepts. Automaton has 46756 states and 73603 transitions. Word has length 187 [2024-11-08 15:32:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:37,624 INFO L471 AbstractCegarLoop]: Abstraction has 46756 states and 73603 transitions. [2024-11-08 15:32:37,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 46756 states and 73603 transitions. [2024-11-08 15:32:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:32:37,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:37,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:37,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:32:37,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1335080539, now seen corresponding path program 1 times [2024-11-08 15:32:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:37,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272724247] [2024-11-08 15:32:37,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:37,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:37,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:32:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:32:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:32:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:38,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272724247] [2024-11-08 15:32:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272724247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:38,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:38,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421832105] [2024-11-08 15:32:38,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:38,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:38,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:38,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:38,072 INFO L87 Difference]: Start difference. First operand 46756 states and 73603 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:46,617 INFO L93 Difference]: Finished difference Result 169496 states and 270684 transitions. [2024-11-08 15:32:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:32:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2024-11-08 15:32:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:47,211 INFO L225 Difference]: With dead ends: 169496 [2024-11-08 15:32:47,211 INFO L226 Difference]: Without dead ends: 122760 [2024-11-08 15:32:47,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:32:47,618 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1688 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 4394 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 4457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:47,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 2568 Invalid, 4457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4394 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 15:32:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122760 states. [2024-11-08 15:32:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122760 to 93381. [2024-11-08 15:32:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93381 states, 86437 states have (on average 1.5275865659381977) internal successors, (132040), 86694 states have internal predecessors, (132040), 5145 states have call successors, (5145), 1542 states have call predecessors, (5145), 1798 states have return successors, (11962), 5400 states have call predecessors, (11962), 5145 states have call successors, (11962) [2024-11-08 15:32:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93381 states to 93381 states and 149147 transitions. [2024-11-08 15:32:53,060 INFO L78 Accepts]: Start accepts. Automaton has 93381 states and 149147 transitions. Word has length 187 [2024-11-08 15:32:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:53,061 INFO L471 AbstractCegarLoop]: Abstraction has 93381 states and 149147 transitions. [2024-11-08 15:32:53,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:32:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 93381 states and 149147 transitions. [2024-11-08 15:32:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 15:32:53,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:53,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:53,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:32:53,184 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:53,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:53,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1190415143, now seen corresponding path program 1 times [2024-11-08 15:32:53,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:53,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472154663] [2024-11-08 15:32:53,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:53,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:32:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:32:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:32:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472154663] [2024-11-08 15:32:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472154663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:53,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:53,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:53,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955712830] [2024-11-08 15:32:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:53,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:53,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:53,763 INFO L87 Difference]: Start difference. First operand 93381 states and 149147 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 5 states have internal predecessors, (177), 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)