./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/token_ring.11.cil-2.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/token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5f603027c62ff37561a520351662dbe2fd253b52e04e36028cb9a624978ef8e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:23:53,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:23:53,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:23:53,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:23:53,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:23:53,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:23:53,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:23:53,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:23:53,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:23:53,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:23:53,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:23:53,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:23:53,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:23:53,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:23:53,582 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:23:53,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:23:53,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:23:53,583 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:23:53,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:23:53,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:23:53,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:23:53,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:23:53,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:23:53,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:23:53,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:23:53,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:23:53,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:23:53,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:23:53,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:23:53,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:23:53,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:23:53,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:23:53,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:23:53,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:23:53,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:23:53,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:23:53,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:23:53,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:23:53,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:23:53,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:23:53,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:23:53,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:23:53,593 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 -> c5f603027c62ff37561a520351662dbe2fd253b52e04e36028cb9a624978ef8e [2024-10-14 03:23:53,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:23:53,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:23:53,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:23:53,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:23:53,809 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:23:53,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.11.cil-2.c [2024-10-14 03:23:55,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:23:55,210 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:23:55,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.11.cil-2.c [2024-10-14 03:23:55,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15758af8/6187077862df4f5db1d4b10fe68cb6b7/FLAG4ca9ecc5d [2024-10-14 03:23:55,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15758af8/6187077862df4f5db1d4b10fe68cb6b7 [2024-10-14 03:23:55,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:23:55,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:23:55,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:23:55,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:23:55,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:23:55,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:55,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45212eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55, skipping insertion in model container [2024-10-14 03:23:55,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:55,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:23:55,758 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/token_ring.11.cil-2.c[671,684] [2024-10-14 03:23:55,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:23:55,861 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:23:55,876 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/token_ring.11.cil-2.c[671,684] [2024-10-14 03:23:55,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:23:55,958 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:23:55,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55 WrapperNode [2024-10-14 03:23:55,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:23:55,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:23:55,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:23:55,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:23:55,965 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:23:55" (1/1) ... [2024-10-14 03:23:55,973 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:23:55" (1/1) ... [2024-10-14 03:23:56,025 INFO L138 Inliner]: procedures = 50, calls = 64, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 819 [2024-10-14 03:23:56,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:23:56,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:23:56,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:23:56,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:23:56,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,070 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:23:56,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:23:56,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:23:56,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:23:56,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:23:56,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (1/1) ... [2024-10-14 03:23:56,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:23:56,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:23:56,135 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:23:56,137 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:23:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:23:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:23:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:23:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:23:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:23:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:23:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:23:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:23:56,176 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:23:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:23:56,176 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:23:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:23:56,176 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:23:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:23:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:23:56,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:23:56,257 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:23:56,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:23:56,923 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-14 03:23:56,923 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:23:56,972 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:23:56,973 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-14 03:23:56,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:56 BoogieIcfgContainer [2024-10-14 03:23:56,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:23:56,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:23:56,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:23:56,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:23:56,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:23:55" (1/3) ... [2024-10-14 03:23:56,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8ee3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:56, skipping insertion in model container [2024-10-14 03:23:56,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:55" (2/3) ... [2024-10-14 03:23:56,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8ee3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:56, skipping insertion in model container [2024-10-14 03:23:56,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:56" (3/3) ... [2024-10-14 03:23:56,982 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.11.cil-2.c [2024-10-14 03:23:56,993 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:23:56,993 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:23:57,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:23:57,068 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;@50aae6dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:23:57,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:23:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 325 states, 292 states have (on average 1.7328767123287672) internal successors, (506), 294 states have internal predecessors, (506), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 03:23:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:23:57,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:57,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:57,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:57,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:57,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1024203250, now seen corresponding path program 1 times [2024-10-14 03:23:57,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:57,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8560540] [2024-10-14 03:23:57,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:57,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:23:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:23:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:23:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:23:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:57,660 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:23:57,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:57,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8560540] [2024-10-14 03:23:57,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8560540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:57,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:57,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:23:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660161790] [2024-10-14 03:23:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:23:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:23:57,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:23:57,693 INFO L87 Difference]: Start difference. First operand has 325 states, 292 states have (on average 1.7328767123287672) internal successors, (506), 294 states have internal predecessors, (506), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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:23:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:59,221 INFO L93 Difference]: Finished difference Result 764 states and 1317 transitions. [2024-10-14 03:23:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:23:59,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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 150 [2024-10-14 03:23:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:59,235 INFO L225 Difference]: With dead ends: 764 [2024-10-14 03:23:59,235 INFO L226 Difference]: Without dead ends: 443 [2024-10-14 03:23:59,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:23:59,245 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 906 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:59,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 584 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:23:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-14 03:23:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 323. [2024-10-14 03:23:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 291 states have (on average 1.6288659793814433) internal successors, (474), 292 states have internal predecessors, (474), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 03:23:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 524 transitions. [2024-10-14 03:23:59,318 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 524 transitions. Word has length 150 [2024-10-14 03:23:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:59,319 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 524 transitions. [2024-10-14 03:23:59,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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:23:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 524 transitions. [2024-10-14 03:23:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:23:59,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:59,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:59,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:23:59,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:59,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1450757748, now seen corresponding path program 1 times [2024-10-14 03:23:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:59,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691771229] [2024-10-14 03:23:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:59,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:59,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:23:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:59,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:23:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:23:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:23:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:59,526 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:23:59,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:59,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691771229] [2024-10-14 03:23:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691771229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:59,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:23:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093335572] [2024-10-14 03:23:59,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:59,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:23:59,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:23:59,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:23:59,533 INFO L87 Difference]: Start difference. First operand 323 states and 524 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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:24:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:00,848 INFO L93 Difference]: Finished difference Result 752 states and 1238 transitions. [2024-10-14 03:24:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:24:00,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:00,851 INFO L225 Difference]: With dead ends: 752 [2024-10-14 03:24:00,851 INFO L226 Difference]: Without dead ends: 443 [2024-10-14 03:24:00,853 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:24:00,853 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 895 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:00,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 579 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:24:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-14 03:24:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 323. [2024-10-14 03:24:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 291 states have (on average 1.6254295532646048) internal successors, (473), 292 states have internal predecessors, (473), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 03:24:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 523 transitions. [2024-10-14 03:24:00,873 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 523 transitions. Word has length 150 [2024-10-14 03:24:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:00,873 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 523 transitions. [2024-10-14 03:24:00,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 3 states have internal predecessors, (140), 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:24:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 523 transitions. [2024-10-14 03:24:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:00,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:00,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:00,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:24:00,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:00,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1445255946, now seen corresponding path program 1 times [2024-10-14 03:24:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:00,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501449705] [2024-10-14 03:24:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:00,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:01,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:01,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:01,099 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:24:01,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:01,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501449705] [2024-10-14 03:24:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501449705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:24:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007500083] [2024-10-14 03:24:01,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:24:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:01,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:24:01,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:24:01,103 INFO L87 Difference]: Start difference. First operand 323 states and 523 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 4 states have internal predecessors, (140), 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:24:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:03,286 INFO L93 Difference]: Finished difference Result 1192 states and 1975 transitions. [2024-10-14 03:24:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:24:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 4 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:03,291 INFO L225 Difference]: With dead ends: 1192 [2024-10-14 03:24:03,291 INFO L226 Difference]: Without dead ends: 886 [2024-10-14 03:24:03,293 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:24:03,294 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1367 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:03,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1120 Invalid, 2274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 03:24:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-14 03:24:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 647. [2024-10-14 03:24:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 588 states have (on average 1.6360544217687074) internal successors, (962), 590 states have internal predecessors, (962), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-14 03:24:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1055 transitions. [2024-10-14 03:24:03,342 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1055 transitions. Word has length 150 [2024-10-14 03:24:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:03,343 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 1055 transitions. [2024-10-14 03:24:03,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 4 states have internal predecessors, (140), 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:24:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1055 transitions. [2024-10-14 03:24:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:03,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:03,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:03,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:24:03,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:03,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1324030094, now seen corresponding path program 1 times [2024-10-14 03:24:03,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:03,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929886558] [2024-10-14 03:24:03,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:03,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:03,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:03,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:03,632 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:24:03,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:03,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929886558] [2024-10-14 03:24:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929886558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:03,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:03,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24679207] [2024-10-14 03:24:03,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:03,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:03,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:03,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:03,635 INFO L87 Difference]: Start difference. First operand 647 states and 1055 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:06,354 INFO L93 Difference]: Finished difference Result 1977 states and 3277 transitions. [2024-10-14 03:24:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:24:06,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:06,361 INFO L225 Difference]: With dead ends: 1977 [2024-10-14 03:24:06,361 INFO L226 Difference]: Without dead ends: 1347 [2024-10-14 03:24:06,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:24:06,364 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 1398 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 3514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:06,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 1857 Invalid, 3514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 03:24:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-10-14 03:24:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 946. [2024-10-14 03:24:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 860 states have (on average 1.6290697674418604) internal successors, (1401), 863 states have internal predecessors, (1401), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-14 03:24:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1536 transitions. [2024-10-14 03:24:06,416 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1536 transitions. Word has length 150 [2024-10-14 03:24:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:06,417 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1536 transitions. [2024-10-14 03:24:06,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1536 transitions. [2024-10-14 03:24:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:06,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:06,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:06,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:24:06,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:06,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:06,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1999190220, now seen corresponding path program 1 times [2024-10-14 03:24:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:06,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449707901] [2024-10-14 03:24:06,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:06,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,638 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:24:06,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449707901] [2024-10-14 03:24:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449707901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:06,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:06,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089855390] [2024-10-14 03:24:06,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:06,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:06,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:06,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:06,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:06,640 INFO L87 Difference]: Start difference. First operand 946 states and 1536 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:09,269 INFO L93 Difference]: Finished difference Result 3127 states and 5172 transitions. [2024-10-14 03:24:09,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:24:09,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:09,278 INFO L225 Difference]: With dead ends: 3127 [2024-10-14 03:24:09,278 INFO L226 Difference]: Without dead ends: 2198 [2024-10-14 03:24:09,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:24:09,281 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1396 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3451 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:09,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 1855 Invalid, 3512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3451 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 03:24:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2024-10-14 03:24:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1545. [2024-10-14 03:24:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.6227758007117439) internal successors, (2280), 1410 states have internal predecessors, (2280), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-14 03:24:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2503 transitions. [2024-10-14 03:24:09,361 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2503 transitions. Word has length 150 [2024-10-14 03:24:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:09,362 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2503 transitions. [2024-10-14 03:24:09,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2503 transitions. [2024-10-14 03:24:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:09,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:09,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:09,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:24:09,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:09,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:09,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1051138254, now seen corresponding path program 1 times [2024-10-14 03:24:09,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:09,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348422565] [2024-10-14 03:24:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:09,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:09,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:09,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:09,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:09,648 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:24:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348422565] [2024-10-14 03:24:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348422565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:09,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:09,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933624548] [2024-10-14 03:24:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:09,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:09,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:09,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:09,651 INFO L87 Difference]: Start difference. First operand 1545 states and 2503 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:11,039 INFO L93 Difference]: Finished difference Result 3716 states and 6132 transitions. [2024-10-14 03:24:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:11,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:11,047 INFO L225 Difference]: With dead ends: 3716 [2024-10-14 03:24:11,047 INFO L226 Difference]: Without dead ends: 2188 [2024-10-14 03:24:11,050 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:24:11,051 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 999 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:11,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 953 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:24:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2024-10-14 03:24:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 1545. [2024-10-14 03:24:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.6192170818505338) internal successors, (2275), 1410 states have internal predecessors, (2275), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-14 03:24:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2498 transitions. [2024-10-14 03:24:11,126 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2498 transitions. Word has length 150 [2024-10-14 03:24:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:11,126 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2498 transitions. [2024-10-14 03:24:11,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2498 transitions. [2024-10-14 03:24:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:11,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:11,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:11,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:24:11,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:11,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash 466366604, now seen corresponding path program 1 times [2024-10-14 03:24:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345173386] [2024-10-14 03:24:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:11,329 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:24:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345173386] [2024-10-14 03:24:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345173386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:11,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:11,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254574200] [2024-10-14 03:24:11,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:11,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:11,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:11,333 INFO L87 Difference]: Start difference. First operand 1545 states and 2498 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:12,658 INFO L93 Difference]: Finished difference Result 3710 states and 6106 transitions. [2024-10-14 03:24:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:12,667 INFO L225 Difference]: With dead ends: 3710 [2024-10-14 03:24:12,668 INFO L226 Difference]: Without dead ends: 2182 [2024-10-14 03:24:12,672 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:24:12,673 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 997 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:12,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 953 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:24:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2024-10-14 03:24:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 1545. [2024-10-14 03:24:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.6156583629893237) internal successors, (2270), 1410 states have internal predecessors, (2270), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-14 03:24:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2493 transitions. [2024-10-14 03:24:12,749 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2493 transitions. Word has length 150 [2024-10-14 03:24:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:12,752 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2493 transitions. [2024-10-14 03:24:12,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2493 transitions. [2024-10-14 03:24:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:12,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:12,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:12,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:24:12,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:12,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash 31861006, now seen corresponding path program 1 times [2024-10-14 03:24:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911587249] [2024-10-14 03:24:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:12,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:12,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:12,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:24:12,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:12,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911587249] [2024-10-14 03:24:12,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911587249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:12,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:12,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:12,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619498531] [2024-10-14 03:24:12,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:12,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:12,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:12,937 INFO L87 Difference]: Start difference. First operand 1545 states and 2493 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:14,391 INFO L93 Difference]: Finished difference Result 3703 states and 6078 transitions. [2024-10-14 03:24:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:14,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:14,399 INFO L225 Difference]: With dead ends: 3703 [2024-10-14 03:24:14,399 INFO L226 Difference]: Without dead ends: 2175 [2024-10-14 03:24:14,402 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:24:14,403 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1000 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:14,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 953 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:24:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2024-10-14 03:24:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 1545. [2024-10-14 03:24:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.612099644128114) internal successors, (2265), 1410 states have internal predecessors, (2265), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-14 03:24:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2488 transitions. [2024-10-14 03:24:14,501 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2488 transitions. Word has length 150 [2024-10-14 03:24:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:14,501 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2488 transitions. [2024-10-14 03:24:14,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2488 transitions. [2024-10-14 03:24:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:14,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:14,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:14,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:24:14,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:14,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:14,504 INFO L85 PathProgramCache]: Analyzing trace with hash -397797300, now seen corresponding path program 1 times [2024-10-14 03:24:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:14,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144552544] [2024-10-14 03:24:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:14,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:14,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:14,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:14,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:14,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:14,689 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:24:14,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:14,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144552544] [2024-10-14 03:24:14,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144552544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:14,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:14,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957193765] [2024-10-14 03:24:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:14,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:14,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:14,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:14,691 INFO L87 Difference]: Start difference. First operand 1545 states and 2488 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:15,872 INFO L93 Difference]: Finished difference Result 3691 states and 6040 transitions. [2024-10-14 03:24:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:15,880 INFO L225 Difference]: With dead ends: 3691 [2024-10-14 03:24:15,881 INFO L226 Difference]: Without dead ends: 2163 [2024-10-14 03:24:15,884 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:24:15,884 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1138 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:15,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 802 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:24:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2024-10-14 03:24:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1545. [2024-10-14 03:24:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1405 states have (on average 1.6085409252669038) internal successors, (2260), 1410 states have internal predecessors, (2260), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-14 03:24:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2483 transitions. [2024-10-14 03:24:15,957 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2483 transitions. Word has length 150 [2024-10-14 03:24:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:15,958 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2483 transitions. [2024-10-14 03:24:15,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2483 transitions. [2024-10-14 03:24:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:15,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:15,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:15,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:24:15,960 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:15,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash 549240586, now seen corresponding path program 1 times [2024-10-14 03:24:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100762875] [2024-10-14 03:24:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:16,163 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:24:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100762875] [2024-10-14 03:24:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100762875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:16,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:16,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:16,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592431829] [2024-10-14 03:24:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:16,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:16,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:16,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:16,165 INFO L87 Difference]: Start difference. First operand 1545 states and 2483 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:18,667 INFO L93 Difference]: Finished difference Result 5297 states and 8629 transitions. [2024-10-14 03:24:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:24:18,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:18,680 INFO L225 Difference]: With dead ends: 5297 [2024-10-14 03:24:18,680 INFO L226 Difference]: Without dead ends: 3769 [2024-10-14 03:24:18,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:24:18,684 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1367 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:18,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1855 Invalid, 3382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 03:24:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2024-10-14 03:24:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 2766. [2024-10-14 03:24:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2518 states have (on average 1.601667990468626) internal successors, (4033), 2527 states have internal predecessors, (4033), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-14 03:24:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4438 transitions. [2024-10-14 03:24:18,814 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4438 transitions. Word has length 150 [2024-10-14 03:24:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:18,815 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4438 transitions. [2024-10-14 03:24:18,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4438 transitions. [2024-10-14 03:24:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:18,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:18,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:18,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:24:18,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:18,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1411074188, now seen corresponding path program 1 times [2024-10-14 03:24:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:18,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354302938] [2024-10-14 03:24:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:18,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:18,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:18,993 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:24:18,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354302938] [2024-10-14 03:24:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354302938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:18,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300671287] [2024-10-14 03:24:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:19,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:19,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:19,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:19,010 INFO L87 Difference]: Start difference. First operand 2766 states and 4438 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:21,730 INFO L93 Difference]: Finished difference Result 9702 states and 15780 transitions. [2024-10-14 03:24:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:24:21,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:21,756 INFO L225 Difference]: With dead ends: 9702 [2024-10-14 03:24:21,757 INFO L226 Difference]: Without dead ends: 6953 [2024-10-14 03:24:21,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:24:21,763 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1366 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3308 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:21,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 1855 Invalid, 3369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3308 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 03:24:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6953 states. [2024-10-14 03:24:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6953 to 5205. [2024-10-14 03:24:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5205 states, 4741 states have (on average 1.5964986289812275) internal successors, (7569), 4758 states have internal predecessors, (7569), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-14 03:24:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 8356 transitions. [2024-10-14 03:24:22,061 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 8356 transitions. Word has length 150 [2024-10-14 03:24:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:22,061 INFO L471 AbstractCegarLoop]: Abstraction has 5205 states and 8356 transitions. [2024-10-14 03:24:22,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 8356 transitions. [2024-10-14 03:24:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:22,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:22,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:22,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:24:22,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:22,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash -639334710, now seen corresponding path program 1 times [2024-10-14 03:24:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:22,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508466147] [2024-10-14 03:24:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:22,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:22,236 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:24:22,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:22,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508466147] [2024-10-14 03:24:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508466147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:22,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:22,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527239210] [2024-10-14 03:24:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:22,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:22,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:22,238 INFO L87 Difference]: Start difference. First operand 5205 states and 8356 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:25,209 INFO L93 Difference]: Finished difference Result 18503 states and 30124 transitions. [2024-10-14 03:24:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:24:25,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:25,243 INFO L225 Difference]: With dead ends: 18503 [2024-10-14 03:24:25,243 INFO L226 Difference]: Without dead ends: 13315 [2024-10-14 03:24:25,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:24:25,254 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1365 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3295 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:25,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 1855 Invalid, 3356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3295 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 03:24:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13315 states. [2024-10-14 03:24:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13315 to 10098. [2024-10-14 03:24:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10098 states, 9202 states have (on average 1.5934579439252337) internal successors, (14663), 9235 states have internal predecessors, (14663), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-14 03:24:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 16268 transitions. [2024-10-14 03:24:25,852 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 16268 transitions. Word has length 150 [2024-10-14 03:24:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:25,852 INFO L471 AbstractCegarLoop]: Abstraction has 10098 states and 16268 transitions. [2024-10-14 03:24:25,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 16268 transitions. [2024-10-14 03:24:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:25,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:25,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:25,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:24:25,859 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:25,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash -151287604, now seen corresponding path program 1 times [2024-10-14 03:24:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:25,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366861177] [2024-10-14 03:24:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:25,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:26,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:26,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:26,020 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:24:26,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:26,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366861177] [2024-10-14 03:24:26,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366861177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:26,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:26,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:26,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968178760] [2024-10-14 03:24:26,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:26,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:26,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:26,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:26,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:26,022 INFO L87 Difference]: Start difference. First operand 10098 states and 16268 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:27,805 INFO L93 Difference]: Finished difference Result 23561 states and 38573 transitions. [2024-10-14 03:24:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:24:27,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:27,837 INFO L225 Difference]: With dead ends: 23561 [2024-10-14 03:24:27,837 INFO L226 Difference]: Without dead ends: 13480 [2024-10-14 03:24:27,855 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:24:27,855 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 998 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:27,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 953 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:24:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13480 states. [2024-10-14 03:24:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13480 to 10098. [2024-10-14 03:24:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10098 states, 9202 states have (on average 1.5898717670071723) internal successors, (14630), 9235 states have internal predecessors, (14630), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-14 03:24:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 16235 transitions. [2024-10-14 03:24:28,540 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 16235 transitions. Word has length 150 [2024-10-14 03:24:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:28,541 INFO L471 AbstractCegarLoop]: Abstraction has 10098 states and 16235 transitions. [2024-10-14 03:24:28,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 16235 transitions. [2024-10-14 03:24:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:28,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:28,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:28,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:24:28,550 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:28,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:28,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1243922806, now seen corresponding path program 1 times [2024-10-14 03:24:28,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:28,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689329317] [2024-10-14 03:24:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:28,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:28,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:28,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:28,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:28,754 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:24:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:28,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689329317] [2024-10-14 03:24:28,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689329317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:28,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:28,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:28,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753986829] [2024-10-14 03:24:28,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:28,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:28,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:28,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:28,757 INFO L87 Difference]: Start difference. First operand 10098 states and 16235 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:32,603 INFO L93 Difference]: Finished difference Result 40552 states and 66040 transitions. [2024-10-14 03:24:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:24:32,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:32,678 INFO L225 Difference]: With dead ends: 40552 [2024-10-14 03:24:32,679 INFO L226 Difference]: Without dead ends: 30471 [2024-10-14 03:24:32,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:24:32,702 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1756 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:32,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 1848 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3247 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 03:24:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30471 states. [2024-10-14 03:24:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30471 to 19884. [2024-10-14 03:24:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19884 states, 18156 states have (on average 1.5881251376955277) internal successors, (28834), 18221 states have internal predecessors, (28834), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 454 states have return successors, (2066), 1336 states have call predecessors, (2066), 1273 states have call successors, (2066) [2024-10-14 03:24:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19884 states to 19884 states and 32173 transitions. [2024-10-14 03:24:34,273 INFO L78 Accepts]: Start accepts. Automaton has 19884 states and 32173 transitions. Word has length 150 [2024-10-14 03:24:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:34,274 INFO L471 AbstractCegarLoop]: Abstraction has 19884 states and 32173 transitions. [2024-10-14 03:24:34,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 19884 states and 32173 transitions. [2024-10-14 03:24:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:34,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:34,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:34,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:24:34,284 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:34,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1768872204, now seen corresponding path program 1 times [2024-10-14 03:24:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:34,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248843579] [2024-10-14 03:24:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:34,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:34,443 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:24:34,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248843579] [2024-10-14 03:24:34,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248843579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:34,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:34,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:34,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100050390] [2024-10-14 03:24:34,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:34,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:34,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:34,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:34,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:34,445 INFO L87 Difference]: Start difference. First operand 19884 states and 32173 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:40,230 INFO L93 Difference]: Finished difference Result 79344 states and 130040 transitions. [2024-10-14 03:24:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:24:40,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:40,510 INFO L225 Difference]: With dead ends: 79344 [2024-10-14 03:24:40,510 INFO L226 Difference]: Without dead ends: 59477 [2024-10-14 03:24:40,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:24:40,555 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1453 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 3849 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 3912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:40,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1844 Invalid, 3912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3849 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 03:24:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59477 states. [2024-10-14 03:24:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59477 to 39133. [2024-10-14 03:24:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39133 states, 35773 states have (on average 1.587454225253683) internal successors, (56788), 35902 states have internal predecessors, (56788), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 902 states have return successors, (4772), 2584 states have call predecessors, (4772), 2457 states have call successors, (4772) [2024-10-14 03:24:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39133 states to 39133 states and 64017 transitions. [2024-10-14 03:24:43,355 INFO L78 Accepts]: Start accepts. Automaton has 39133 states and 64017 transitions. Word has length 150 [2024-10-14 03:24:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:43,355 INFO L471 AbstractCegarLoop]: Abstraction has 39133 states and 64017 transitions. [2024-10-14 03:24:43,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 39133 states and 64017 transitions. [2024-10-14 03:24:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:43,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:43,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:43,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:24:43,372 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:43,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash -73603510, now seen corresponding path program 1 times [2024-10-14 03:24:43,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:43,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929932541] [2024-10-14 03:24:43,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:43,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:43,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:43,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:43,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:43,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:43,529 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:24:43,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929932541] [2024-10-14 03:24:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929932541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:43,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058365489] [2024-10-14 03:24:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:43,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:43,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:43,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:43,532 INFO L87 Difference]: Start difference. First operand 39133 states and 64017 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:52,317 INFO L93 Difference]: Finished difference Result 153405 states and 254218 transitions. [2024-10-14 03:24:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:24:52,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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 150 [2024-10-14 03:24:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:52,732 INFO L225 Difference]: With dead ends: 153405 [2024-10-14 03:24:52,732 INFO L226 Difference]: Without dead ends: 114289 [2024-10-14 03:24:52,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:24:52,869 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1651 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3202 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:52,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 1848 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3202 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 03:24:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114289 states. [2024-10-14 03:24:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114289 to 78079. [2024-10-14 03:24:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78079 states, 71519 states have (on average 1.5882772410128776) internal successors, (113592), 71776 states have internal predecessors, (113592), 4761 states have call successors, (4761), 1542 states have call predecessors, (4761), 1798 states have return successors, (11578), 5016 states have call predecessors, (11578), 4761 states have call successors, (11578) [2024-10-14 03:24:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78079 states to 78079 states and 129931 transitions. [2024-10-14 03:24:58,873 INFO L78 Accepts]: Start accepts. Automaton has 78079 states and 129931 transitions. Word has length 150 [2024-10-14 03:24:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:58,874 INFO L471 AbstractCegarLoop]: Abstraction has 78079 states and 129931 transitions. [2024-10-14 03:24:58,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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:24:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 78079 states and 129931 transitions. [2024-10-14 03:24:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:24:58,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:58,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:24:58,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:24:58,918 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:58,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash -406246648, now seen corresponding path program 1 times [2024-10-14 03:24:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766537774] [2024-10-14 03:24:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:58,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:24:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:24:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 03:24:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:59,075 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:24:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766537774] [2024-10-14 03:24:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766537774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:24:59,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:24:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985612828] [2024-10-14 03:24:59,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:59,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:24:59,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:59,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:24:59,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:59,078 INFO L87 Difference]: Start difference. First operand 78079 states and 129931 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 5 states have internal predecessors, (140), 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)