./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.08.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.08.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 d0fbb3eaba725aed5c3b8bf09c66f0f1daed4feeee0b9a3792dc033de334e501 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:25:14,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:25:14,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:25:14,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:25:14,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:25:14,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:25:14,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:25:14,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:25:14,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:25:14,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:25:14,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:25:14,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:25:14,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:25:14,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:25:14,910 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:25:14,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:25:14,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:25:14,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:25:14,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:25:14,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:25:14,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:25:14,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:25:14,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:25:14,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:25:14,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:25:14,917 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:25:14,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:25:14,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:25:14,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:25:14,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:25:14,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:25:14,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:25:14,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:25:14,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:25:14,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:25:14,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:25:14,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:25:14,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:25:14,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:25:14,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:25:14,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:25:14,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:25:14,924 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 -> d0fbb3eaba725aed5c3b8bf09c66f0f1daed4feeee0b9a3792dc033de334e501 [2024-10-14 03:25:15,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:25:15,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:25:15,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:25:15,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:25:15,224 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:25:15,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.08.cil.c [2024-10-14 03:25:16,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:25:16,928 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:25:16,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.08.cil.c [2024-10-14 03:25:16,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777a91c55/9bf3d058fa054e67b362789161f20ebb/FLAG72e5acd2e [2024-10-14 03:25:17,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777a91c55/9bf3d058fa054e67b362789161f20ebb [2024-10-14 03:25:17,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:25:17,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:25:17,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:25:17,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:25:17,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:25:17,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e87f9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17, skipping insertion in model container [2024-10-14 03:25:17,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:25:17,483 WARN L248 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.08.cil.c[706,719] [2024-10-14 03:25:17,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:25:17,597 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:25:17,608 WARN L248 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.08.cil.c[706,719] [2024-10-14 03:25:17,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:25:17,681 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:25:17,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17 WrapperNode [2024-10-14 03:25:17,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:25:17,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:25:17,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:25:17,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:25:17,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,737 INFO L138 Inliner]: procedures = 44, calls = 54, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 623 [2024-10-14 03:25:17,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:25:17,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:25:17,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:25:17,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:25:17,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,782 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-10-14 03:25:17,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:25:17,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:25:17,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:25:17,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:25:17,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (1/1) ... [2024-10-14 03:25:17,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:25:17,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:17,863 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-10-14 03:25:17,866 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-10-14 03:25:17,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:25:17,918 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:25:17,919 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:25:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:25:17,919 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:25:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:25:17,920 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:25:17,920 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:25:17,921 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:25:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:25:17,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:25:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:25:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:25:17,922 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:25:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:25:17,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:25:18,045 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:25:18,047 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:25:18,758 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-14 03:25:18,759 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:25:18,825 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:25:18,826 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-14 03:25:18,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:25:18 BoogieIcfgContainer [2024-10-14 03:25:18,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:25:18,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:25:18,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:25:18,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:25:18,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:25:17" (1/3) ... [2024-10-14 03:25:18,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313603ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:25:18, skipping insertion in model container [2024-10-14 03:25:18,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:17" (2/3) ... [2024-10-14 03:25:18,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313603ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:25:18, skipping insertion in model container [2024-10-14 03:25:18,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:25:18" (3/3) ... [2024-10-14 03:25:18,839 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.08.cil.c [2024-10-14 03:25:18,856 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:25:18,856 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:25:18,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:25:18,950 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;@7cc0a17e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:25:18,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:25:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 251 states, 222 states have (on average 1.7252252252252251) internal successors, (383), 224 states have internal predecessors, (383), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 03:25:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:18,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:18,977 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] [2024-10-14 03:25:18,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:18,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash -178011246, now seen corresponding path program 1 times [2024-10-14 03:25:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:18,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446104356] [2024-10-14 03:25:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:19,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:19,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446104356] [2024-10-14 03:25:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446104356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:19,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:19,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:25:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342165286] [2024-10-14 03:25:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:19,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:25:19,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:25:19,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:25:19,577 INFO L87 Difference]: Start difference. First operand has 251 states, 222 states have (on average 1.7252252252252251) internal successors, (383), 224 states have internal predecessors, (383), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 3 states have internal predecessors, (115), 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-10-14 03:25:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:21,005 INFO L93 Difference]: Finished difference Result 580 states and 988 transitions. [2024-10-14 03:25:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:25:21,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 3 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:21,031 INFO L225 Difference]: With dead ends: 580 [2024-10-14 03:25:21,031 INFO L226 Difference]: Without dead ends: 337 [2024-10-14 03:25:21,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:25:21,042 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 674 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:21,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 447 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:25:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-14 03:25:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 249. [2024-10-14 03:25:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 221 states have (on average 1.6063348416289593) internal successors, (355), 222 states have internal predecessors, (355), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 03:25:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 397 transitions. [2024-10-14 03:25:21,122 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 397 transitions. Word has length 125 [2024-10-14 03:25:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:21,123 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 397 transitions. [2024-10-14 03:25:21,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 3 states have internal predecessors, (115), 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-10-14 03:25:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 397 transitions. [2024-10-14 03:25:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:21,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:21,132 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] [2024-10-14 03:25:21,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:25:21,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:21,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2115069780, now seen corresponding path program 1 times [2024-10-14 03:25:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:21,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652991057] [2024-10-14 03:25:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:21,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:21,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652991057] [2024-10-14 03:25:21,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652991057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:21,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:21,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:21,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562568272] [2024-10-14 03:25:21,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:21,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:21,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:21,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:21,510 INFO L87 Difference]: Start difference. First operand 249 states and 397 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 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-10-14 03:25:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:23,557 INFO L93 Difference]: Finished difference Result 905 states and 1486 transitions. [2024-10-14 03:25:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:25:23,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:23,566 INFO L225 Difference]: With dead ends: 905 [2024-10-14 03:25:23,566 INFO L226 Difference]: Without dead ends: 670 [2024-10-14 03:25:23,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:23,573 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1014 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:23,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 748 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:25:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-14 03:25:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 495. [2024-10-14 03:25:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 444 states have (on average 1.6126126126126126) internal successors, (716), 446 states have internal predecessors, (716), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-14 03:25:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 793 transitions. [2024-10-14 03:25:23,654 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 793 transitions. Word has length 125 [2024-10-14 03:25:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:23,655 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 793 transitions. [2024-10-14 03:25:23,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 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-10-14 03:25:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 793 transitions. [2024-10-14 03:25:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:23,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:23,661 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] [2024-10-14 03:25:23,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:25:23,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:23,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1592641033, now seen corresponding path program 1 times [2024-10-14 03:25:23,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561514892] [2024-10-14 03:25:23,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:23,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:23,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:23,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561514892] [2024-10-14 03:25:23,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561514892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:23,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:23,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121536056] [2024-10-14 03:25:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:23,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:23,968 INFO L87 Difference]: Start difference. First operand 495 states and 793 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:26,961 INFO L93 Difference]: Finished difference Result 1601 states and 2604 transitions. [2024-10-14 03:25:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:26,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:26,971 INFO L225 Difference]: With dead ends: 1601 [2024-10-14 03:25:26,971 INFO L226 Difference]: Without dead ends: 1120 [2024-10-14 03:25:26,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:25:26,976 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 1106 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 3195 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 3248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:26,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1430 Invalid, 3248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3195 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 03:25:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-10-14 03:25:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 723. [2024-10-14 03:25:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 649 states have (on average 1.6040061633281972) internal successors, (1041), 652 states have internal predecessors, (1041), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-14 03:25:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1152 transitions. [2024-10-14 03:25:27,032 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1152 transitions. Word has length 125 [2024-10-14 03:25:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:27,033 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1152 transitions. [2024-10-14 03:25:27,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1152 transitions. [2024-10-14 03:25:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:27,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:27,036 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] [2024-10-14 03:25:27,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:25:27,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:27,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 729160885, now seen corresponding path program 1 times [2024-10-14 03:25:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559674480] [2024-10-14 03:25:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559674480] [2024-10-14 03:25:27,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559674480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597422435] [2024-10-14 03:25:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:27,281 INFO L87 Difference]: Start difference. First operand 723 states and 1152 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:30,131 INFO L93 Difference]: Finished difference Result 2467 states and 4001 transitions. [2024-10-14 03:25:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:30,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:30,140 INFO L225 Difference]: With dead ends: 2467 [2024-10-14 03:25:30,140 INFO L226 Difference]: Without dead ends: 1758 [2024-10-14 03:25:30,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:25:30,143 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 1104 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:30,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 1428 Invalid, 3246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 03:25:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2024-10-14 03:25:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1180. [2024-10-14 03:25:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1060 states have (on average 1.5962264150943397) internal successors, (1692), 1065 states have internal predecessors, (1692), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 03:25:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1875 transitions. [2024-10-14 03:25:30,237 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1875 transitions. Word has length 125 [2024-10-14 03:25:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:30,237 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1875 transitions. [2024-10-14 03:25:30,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1875 transitions. [2024-10-14 03:25:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:30,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:30,240 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] [2024-10-14 03:25:30,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:25:30,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:30,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1412699593, now seen corresponding path program 1 times [2024-10-14 03:25:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801396055] [2024-10-14 03:25:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:30,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:30,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:30,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:30,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801396055] [2024-10-14 03:25:30,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801396055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:30,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:30,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656794444] [2024-10-14 03:25:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:30,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:30,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:30,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:30,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:30,476 INFO L87 Difference]: Start difference. First operand 1180 states and 1875 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:31,677 INFO L93 Difference]: Finished difference Result 2808 states and 4544 transitions. [2024-10-14 03:25:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:31,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:31,688 INFO L225 Difference]: With dead ends: 2808 [2024-10-14 03:25:31,688 INFO L226 Difference]: Without dead ends: 1642 [2024-10-14 03:25:31,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:31,694 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 801 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:31,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 721 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:25:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2024-10-14 03:25:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1180. [2024-10-14 03:25:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1060 states have (on average 1.5915094339622642) internal successors, (1687), 1065 states have internal predecessors, (1687), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 03:25:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1870 transitions. [2024-10-14 03:25:31,807 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1870 transitions. Word has length 125 [2024-10-14 03:25:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:31,807 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1870 transitions. [2024-10-14 03:25:31,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1870 transitions. [2024-10-14 03:25:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:31,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:31,810 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] [2024-10-14 03:25:31,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:25:31,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:31,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2035981195, now seen corresponding path program 1 times [2024-10-14 03:25:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:31,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003696790] [2024-10-14 03:25:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:31,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:31,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003696790] [2024-10-14 03:25:32,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003696790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:32,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:32,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191908199] [2024-10-14 03:25:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:32,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:32,005 INFO L87 Difference]: Start difference. First operand 1180 states and 1870 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:33,127 INFO L93 Difference]: Finished difference Result 2802 states and 4518 transitions. [2024-10-14 03:25:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:33,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:33,136 INFO L225 Difference]: With dead ends: 2802 [2024-10-14 03:25:33,136 INFO L226 Difference]: Without dead ends: 1636 [2024-10-14 03:25:33,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:33,140 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 745 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:33,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 722 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:25:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2024-10-14 03:25:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1180. [2024-10-14 03:25:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1060 states have (on average 1.5867924528301887) internal successors, (1682), 1065 states have internal predecessors, (1682), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 03:25:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1865 transitions. [2024-10-14 03:25:33,214 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1865 transitions. Word has length 125 [2024-10-14 03:25:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:33,215 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1865 transitions. [2024-10-14 03:25:33,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1865 transitions. [2024-10-14 03:25:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:33,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:33,217 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] [2024-10-14 03:25:33,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:25:33,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:33,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1917539721, now seen corresponding path program 1 times [2024-10-14 03:25:33,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:33,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531356001] [2024-10-14 03:25:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:33,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:33,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:33,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531356001] [2024-10-14 03:25:33,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531356001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:33,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117500342] [2024-10-14 03:25:33,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:33,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:33,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:33,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:33,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:33,430 INFO L87 Difference]: Start difference. First operand 1180 states and 1865 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:34,473 INFO L93 Difference]: Finished difference Result 2795 states and 4490 transitions. [2024-10-14 03:25:34,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:34,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:34,481 INFO L225 Difference]: With dead ends: 2795 [2024-10-14 03:25:34,481 INFO L226 Difference]: Without dead ends: 1629 [2024-10-14 03:25:34,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:34,489 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 851 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:34,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 605 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:25:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-10-14 03:25:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1180. [2024-10-14 03:25:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1060 states have (on average 1.5820754716981131) internal successors, (1677), 1065 states have internal predecessors, (1677), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 03:25:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1860 transitions. [2024-10-14 03:25:34,571 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1860 transitions. Word has length 125 [2024-10-14 03:25:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:34,571 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1860 transitions. [2024-10-14 03:25:34,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1860 transitions. [2024-10-14 03:25:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:34,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:34,575 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] [2024-10-14 03:25:34,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:25:34,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:34,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash -528245707, now seen corresponding path program 1 times [2024-10-14 03:25:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120089230] [2024-10-14 03:25:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:34,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120089230] [2024-10-14 03:25:34,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120089230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:34,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:34,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397352911] [2024-10-14 03:25:34,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:34,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:34,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:34,785 INFO L87 Difference]: Start difference. First operand 1180 states and 1860 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:37,529 INFO L93 Difference]: Finished difference Result 4107 states and 6560 transitions. [2024-10-14 03:25:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:37,543 INFO L225 Difference]: With dead ends: 4107 [2024-10-14 03:25:37,543 INFO L226 Difference]: Without dead ends: 2941 [2024-10-14 03:25:37,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:25:37,548 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 1082 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:37,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 1428 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3105 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 03:25:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2024-10-14 03:25:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2107. [2024-10-14 03:25:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1895 states have (on average 1.5736147757255936) internal successors, (2982), 1904 states have internal predecessors, (2982), 149 states have call successors, (149), 54 states have call predecessors, (149), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-10-14 03:25:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 3315 transitions. [2024-10-14 03:25:37,712 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 3315 transitions. Word has length 125 [2024-10-14 03:25:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:37,713 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 3315 transitions. [2024-10-14 03:25:37,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 3315 transitions. [2024-10-14 03:25:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:37,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:37,721 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] [2024-10-14 03:25:37,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:25:37,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:37,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1733327543, now seen corresponding path program 1 times [2024-10-14 03:25:37,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:37,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757023056] [2024-10-14 03:25:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:37,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:37,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:37,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757023056] [2024-10-14 03:25:37,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757023056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:37,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:37,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:37,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746016943] [2024-10-14 03:25:37,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:37,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:37,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:37,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:37,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:37,938 INFO L87 Difference]: Start difference. First operand 2107 states and 3315 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:40,561 INFO L93 Difference]: Finished difference Result 7420 states and 11833 transitions. [2024-10-14 03:25:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:40,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:40,586 INFO L225 Difference]: With dead ends: 7420 [2024-10-14 03:25:40,587 INFO L226 Difference]: Without dead ends: 5327 [2024-10-14 03:25:40,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:25:40,595 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 1078 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 3077 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:40,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1428 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3077 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 03:25:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5327 states. [2024-10-14 03:25:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5327 to 3970. [2024-10-14 03:25:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3970 states, 3574 states have (on average 1.5685506435366536) internal successors, (5606), 3591 states have internal predecessors, (5606), 277 states have call successors, (277), 102 states have call predecessors, (277), 118 states have return successors, (374), 292 states have call predecessors, (374), 277 states have call successors, (374) [2024-10-14 03:25:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 6257 transitions. [2024-10-14 03:25:40,922 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 6257 transitions. Word has length 125 [2024-10-14 03:25:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:40,923 INFO L471 AbstractCegarLoop]: Abstraction has 3970 states and 6257 transitions. [2024-10-14 03:25:40,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 6257 transitions. [2024-10-14 03:25:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:40,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:40,930 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] [2024-10-14 03:25:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:25:40,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:40,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash 426185145, now seen corresponding path program 1 times [2024-10-14 03:25:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132699314] [2024-10-14 03:25:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:41,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:41,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:41,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132699314] [2024-10-14 03:25:41,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132699314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:41,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:41,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260613411] [2024-10-14 03:25:41,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:41,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:41,151 INFO L87 Difference]: Start difference. First operand 3970 states and 6257 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:44,259 INFO L93 Difference]: Finished difference Result 15563 states and 24863 transitions. [2024-10-14 03:25:44,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:44,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:44,326 INFO L225 Difference]: With dead ends: 15563 [2024-10-14 03:25:44,327 INFO L226 Difference]: Without dead ends: 11607 [2024-10-14 03:25:44,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:44,344 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1142 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:44,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1405 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 03:25:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11607 states. [2024-10-14 03:25:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11607 to 7661. [2024-10-14 03:25:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7661 states, 6913 states have (on average 1.5680601764790973) internal successors, (10840), 6946 states have internal predecessors, (10840), 517 states have call successors, (517), 198 states have call predecessors, (517), 230 states have return successors, (792), 548 states have call predecessors, (792), 517 states have call successors, (792) [2024-10-14 03:25:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7661 states to 7661 states and 12149 transitions. [2024-10-14 03:25:44,978 INFO L78 Accepts]: Start accepts. Automaton has 7661 states and 12149 transitions. Word has length 125 [2024-10-14 03:25:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:44,979 INFO L471 AbstractCegarLoop]: Abstraction has 7661 states and 12149 transitions. [2024-10-14 03:25:44,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 7661 states and 12149 transitions. [2024-10-14 03:25:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:44,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:44,991 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] [2024-10-14 03:25:44,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:25:44,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:44,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1971285385, now seen corresponding path program 1 times [2024-10-14 03:25:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458336294] [2024-10-14 03:25:44,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:44,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:45,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:45,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458336294] [2024-10-14 03:25:45,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458336294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:45,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:45,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750414140] [2024-10-14 03:25:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:45,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:45,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:45,163 INFO L87 Difference]: Start difference. First operand 7661 states and 12149 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:46,787 INFO L93 Difference]: Finished difference Result 17678 states and 28470 transitions. [2024-10-14 03:25:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:46,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:46,919 INFO L225 Difference]: With dead ends: 17678 [2024-10-14 03:25:46,919 INFO L226 Difference]: Without dead ends: 10031 [2024-10-14 03:25:46,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:46,941 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 746 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:46,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 721 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:25:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10031 states. [2024-10-14 03:25:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10031 to 7661. [2024-10-14 03:25:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7661 states, 6913 states have (on average 1.5632865615507017) internal successors, (10807), 6946 states have internal predecessors, (10807), 517 states have call successors, (517), 198 states have call predecessors, (517), 230 states have return successors, (792), 548 states have call predecessors, (792), 517 states have call successors, (792) [2024-10-14 03:25:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7661 states to 7661 states and 12116 transitions. [2024-10-14 03:25:47,630 INFO L78 Accepts]: Start accepts. Automaton has 7661 states and 12116 transitions. Word has length 125 [2024-10-14 03:25:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:47,630 INFO L471 AbstractCegarLoop]: Abstraction has 7661 states and 12116 transitions. [2024-10-14 03:25:47,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 7661 states and 12116 transitions. [2024-10-14 03:25:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:47,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:47,641 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] [2024-10-14 03:25:47,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:25:47,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:47,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash -940244487, now seen corresponding path program 1 times [2024-10-14 03:25:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:47,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51940959] [2024-10-14 03:25:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:47,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:47,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51940959] [2024-10-14 03:25:47,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51940959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:47,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:47,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051039232] [2024-10-14 03:25:47,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:47,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:47,829 INFO L87 Difference]: Start difference. First operand 7661 states and 12116 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:51,109 INFO L93 Difference]: Finished difference Result 29398 states and 47069 transitions. [2024-10-14 03:25:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:51,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:51,211 INFO L225 Difference]: With dead ends: 29398 [2024-10-14 03:25:51,212 INFO L226 Difference]: Without dead ends: 21751 [2024-10-14 03:25:51,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:51,248 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1327 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:51,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 930 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:25:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21751 states. [2024-10-14 03:25:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21751 to 15091. [2024-10-14 03:25:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15091 states, 13655 states have (on average 1.5615525448553644) internal successors, (21323), 13720 states have internal predecessors, (21323), 981 states have call successors, (981), 390 states have call predecessors, (981), 454 states have return successors, (1774), 1044 states have call predecessors, (1774), 981 states have call successors, (1774) [2024-10-14 03:25:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15091 states to 15091 states and 24078 transitions. [2024-10-14 03:25:52,531 INFO L78 Accepts]: Start accepts. Automaton has 15091 states and 24078 transitions. Word has length 125 [2024-10-14 03:25:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:52,531 INFO L471 AbstractCegarLoop]: Abstraction has 15091 states and 24078 transitions. [2024-10-14 03:25:52,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 15091 states and 24078 transitions. [2024-10-14 03:25:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:25:52,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:52,553 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] [2024-10-14 03:25:52,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:25:52,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:52,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:52,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1448319543, now seen corresponding path program 1 times [2024-10-14 03:25:52,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:52,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405233203] [2024-10-14 03:25:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:52,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:52,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:25:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:25:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:25:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:52,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:25:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:52,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:52,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405233203] [2024-10-14 03:25:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405233203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:52,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507936909] [2024-10-14 03:25:52,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:52,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:52,733 INFO L87 Difference]: Start difference. First operand 15091 states and 24078 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:25:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:57,882 INFO L93 Difference]: Finished difference Result 57090 states and 92197 transitions. [2024-10-14 03:25:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:25:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:58,082 INFO L225 Difference]: With dead ends: 57090 [2024-10-14 03:25:58,083 INFO L226 Difference]: Without dead ends: 42013 [2024-10-14 03:25:58,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:58,144 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1106 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:58,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1405 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3029 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 03:25:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42013 states. [2024-10-14 03:26:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42013 to 29948. [2024-10-14 03:26:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29948 states, 27168 states have (on average 1.5611381036513545) internal successors, (42413), 27297 states have internal predecessors, (42413), 1877 states have call successors, (1877), 774 states have call predecessors, (1877), 902 states have return successors, (4192), 2004 states have call predecessors, (4192), 1877 states have call successors, (4192) [2024-10-14 03:26:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29948 states to 29948 states and 48482 transitions. [2024-10-14 03:26:00,527 INFO L78 Accepts]: Start accepts. Automaton has 29948 states and 48482 transitions. Word has length 125 [2024-10-14 03:26:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:00,527 INFO L471 AbstractCegarLoop]: Abstraction has 29948 states and 48482 transitions. [2024-10-14 03:26:00,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:26:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 29948 states and 48482 transitions. [2024-10-14 03:26:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:26:00,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:00,566 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] [2024-10-14 03:26:00,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:26:00,566 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:00,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1245576647, now seen corresponding path program 1 times [2024-10-14 03:26:00,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:00,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763243247] [2024-10-14 03:26:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:00,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:26:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:26:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:26:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:26:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:26:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:26:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763243247] [2024-10-14 03:26:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763243247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:00,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767169495] [2024-10-14 03:26:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:00,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:00,725 INFO L87 Difference]: Start difference. First operand 29948 states and 48482 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:26:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:04,237 INFO L93 Difference]: Finished difference Result 68230 states and 112619 transitions. [2024-10-14 03:26:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:26:04,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:26:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:04,381 INFO L225 Difference]: With dead ends: 68230 [2024-10-14 03:26:04,382 INFO L226 Difference]: Without dead ends: 38296 [2024-10-14 03:26:04,451 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-10-14 03:26:04,452 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 746 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:04,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 721 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:26:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38296 states. [2024-10-14 03:26:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38296 to 29948. [2024-10-14 03:26:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29948 states, 27168 states have (on average 1.5563898704358068) internal successors, (42284), 27297 states have internal predecessors, (42284), 1877 states have call successors, (1877), 774 states have call predecessors, (1877), 902 states have return successors, (4192), 2004 states have call predecessors, (4192), 1877 states have call successors, (4192) [2024-10-14 03:26:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29948 states to 29948 states and 48353 transitions. [2024-10-14 03:26:06,891 INFO L78 Accepts]: Start accepts. Automaton has 29948 states and 48353 transitions. Word has length 125 [2024-10-14 03:26:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:06,892 INFO L471 AbstractCegarLoop]: Abstraction has 29948 states and 48353 transitions. [2024-10-14 03:26:06,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:26:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 29948 states and 48353 transitions. [2024-10-14 03:26:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:26:06,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:06,928 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] [2024-10-14 03:26:06,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:26:06,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:06,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1992659447, now seen corresponding path program 1 times [2024-10-14 03:26:06,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:06,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847468607] [2024-10-14 03:26:06,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:06,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:07,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:26:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:07,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:26:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:26:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:07,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:26:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:07,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:26:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:26:07,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:07,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847468607] [2024-10-14 03:26:07,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847468607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:07,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:07,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:07,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151196287] [2024-10-14 03:26:07,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:07,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:07,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:07,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:07,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:07,136 INFO L87 Difference]: Start difference. First operand 29948 states and 48353 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:26:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:14,721 INFO L93 Difference]: Finished difference Result 109847 states and 179523 transitions. [2024-10-14 03:26:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:26:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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 125 [2024-10-14 03:26:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:15,151 INFO L225 Difference]: With dead ends: 109847 [2024-10-14 03:26:15,151 INFO L226 Difference]: Without dead ends: 79913 [2024-10-14 03:26:15,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:26:15,429 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1086 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 2986 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:15,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1405 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2986 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 03:26:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79913 states. [2024-10-14 03:26:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79913 to 59790. [2024-10-14 03:26:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59790 states, 54386 states have (on average 1.5554002868385246) internal successors, (84592), 54643 states have internal predecessors, (84592), 3605 states have call successors, (3605), 1542 states have call predecessors, (3605), 1798 states have return successors, (10422), 3860 states have call predecessors, (10422), 3605 states have call successors, (10422) [2024-10-14 03:26:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59790 states to 59790 states and 98619 transitions. [2024-10-14 03:26:20,199 INFO L78 Accepts]: Start accepts. Automaton has 59790 states and 98619 transitions. Word has length 125 [2024-10-14 03:26:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:20,200 INFO L471 AbstractCegarLoop]: Abstraction has 59790 states and 98619 transitions. [2024-10-14 03:26:20,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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-10-14 03:26:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 59790 states and 98619 transitions. [2024-10-14 03:26:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 03:26:20,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:20,270 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] [2024-10-14 03:26:20,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:26:20,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:20,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:20,271 INFO L85 PathProgramCache]: Analyzing trace with hash -950922631, now seen corresponding path program 1 times [2024-10-14 03:26:20,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:20,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319430463] [2024-10-14 03:26:20,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:20,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:26:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 03:26:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:26:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:26:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:26:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:26:20,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319430463] [2024-10-14 03:26:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319430463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:20,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:20,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:20,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364496484] [2024-10-14 03:26:20,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:20,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:20,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:20,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:20,433 INFO L87 Difference]: Start difference. First operand 59790 states and 98619 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 5 states have internal predecessors, (115), 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)