./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 4a390ef5 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-dev-4a390ef-m [2024-10-24 01:16:05,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:16:05,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:16:05,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:16:05,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:16:05,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:16:05,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:16:05,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:16:05,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:16:05,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:16:05,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:16:05,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:16:05,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:16:05,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:16:05,923 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:16:05,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:16:05,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:16:05,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:16:05,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:16:05,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:16:05,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:16:05,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:16:05,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:16:05,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:16:05,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:16:05,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:16:05,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:16:05,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:16:05,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:16:05,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:16:05,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:16:05,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:16:05,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:16:05,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:16:05,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:16:05,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:16:05,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:16:05,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:16:05,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:16:05,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:16:05,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:16:05,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:16:05,931 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-24 01:16:06,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:16:06,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:16:06,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:16:06,181 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:16:06,182 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:16:06,183 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-24 01:16:07,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:16:07,655 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:16:07,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.11.cil-2.c [2024-10-24 01:16:07,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1bb0d4c/2e020ddebeb44dddb6eeddd08e672fb1/FLAGa5456097c [2024-10-24 01:16:07,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1bb0d4c/2e020ddebeb44dddb6eeddd08e672fb1 [2024-10-24 01:16:07,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:16:07,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:16:07,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:16:07,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:16:07,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:16:07,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:16:07" (1/1) ... [2024-10-24 01:16:07,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b6dc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:07, skipping insertion in model container [2024-10-24 01:16:07,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:16:07" (1/1) ... [2024-10-24 01:16:07,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:16:07,914 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-24 01:16:08,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:16:08,039 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:16:08,048 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-24 01:16:08,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:16:08,125 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:16:08,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08 WrapperNode [2024-10-24 01:16:08,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:16:08,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:16:08,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:16:08,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:16:08,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,176 INFO L138 Inliner]: procedures = 50, calls = 64, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 819 [2024-10-24 01:16:08,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:16:08,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:16:08,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:16:08,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:16:08,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,228 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-24 01:16:08,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:16:08,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:16:08,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:16:08,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:16:08,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (1/1) ... [2024-10-24 01:16:08,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:16:08,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:16:08,320 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-24 01:16:08,324 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-24 01:16:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:16:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 01:16:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 01:16:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 01:16:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 01:16:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 01:16:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 01:16:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 01:16:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 01:16:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 01:16:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 01:16:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 01:16:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 01:16:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:16:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:16:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:16:08,469 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:16:08,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:16:09,257 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-24 01:16:09,258 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:16:09,323 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:16:09,324 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-24 01:16:09,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:16:09 BoogieIcfgContainer [2024-10-24 01:16:09,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:16:09,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:16:09,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:16:09,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:16:09,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:16:07" (1/3) ... [2024-10-24 01:16:09,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8fc243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:16:09, skipping insertion in model container [2024-10-24 01:16:09,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:16:08" (2/3) ... [2024-10-24 01:16:09,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8fc243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:16:09, skipping insertion in model container [2024-10-24 01:16:09,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:16:09" (3/3) ... [2024-10-24 01:16:09,330 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.11.cil-2.c [2024-10-24 01:16:09,344 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:16:09,344 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:16:09,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:16:09,418 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;@7994de9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:16:09,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:16:09,424 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-24 01:16:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:09,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:09,436 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-24 01:16:09,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:09,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1024203250, now seen corresponding path program 1 times [2024-10-24 01:16:09,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:09,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045806964] [2024-10-24 01:16:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,990 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-24 01:16:09,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:09,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045806964] [2024-10-24 01:16:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045806964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:09,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:16:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329426817] [2024-10-24 01:16:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:10,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:16:10,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:16:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:16:10,027 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-24 01:16:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:11,669 INFO L93 Difference]: Finished difference Result 764 states and 1317 transitions. [2024-10-24 01:16:11,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:16:11,675 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-24 01:16:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:11,687 INFO L225 Difference]: With dead ends: 764 [2024-10-24 01:16:11,687 INFO L226 Difference]: Without dead ends: 443 [2024-10-24 01:16:11,691 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-24 01:16:11,693 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 906 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:11,694 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.3s Time] [2024-10-24 01:16:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-24 01:16:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 323. [2024-10-24 01:16:11,749 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-24 01:16:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 524 transitions. [2024-10-24 01:16:11,753 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 524 transitions. Word has length 150 [2024-10-24 01:16:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:11,753 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 524 transitions. [2024-10-24 01:16:11,754 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-24 01:16:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 524 transitions. [2024-10-24 01:16:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:11,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:11,757 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-24 01:16:11,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:16:11,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:11,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1450757748, now seen corresponding path program 1 times [2024-10-24 01:16:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:11,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321316042] [2024-10-24 01:16:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:11,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:11,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:11,975 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-24 01:16:11,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:11,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321316042] [2024-10-24 01:16:11,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321316042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:11,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:16:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281464525] [2024-10-24 01:16:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:11,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:16:11,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:11,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:16:11,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:16:11,978 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-24 01:16:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:13,398 INFO L93 Difference]: Finished difference Result 752 states and 1238 transitions. [2024-10-24 01:16:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:16:13,400 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-24 01:16:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:13,402 INFO L225 Difference]: With dead ends: 752 [2024-10-24 01:16:13,402 INFO L226 Difference]: Without dead ends: 443 [2024-10-24 01:16:13,404 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-24 01:16:13,405 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 895 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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-24 01:16:13,405 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-24 01:16:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-24 01:16:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 323. [2024-10-24 01:16:13,435 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-24 01:16:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 523 transitions. [2024-10-24 01:16:13,438 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 523 transitions. Word has length 150 [2024-10-24 01:16:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:13,438 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 523 transitions. [2024-10-24 01:16:13,439 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-24 01:16:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 523 transitions. [2024-10-24 01:16:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:13,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:13,446 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-24 01:16:13,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:16:13,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:13,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1445255946, now seen corresponding path program 1 times [2024-10-24 01:16:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:13,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610265014] [2024-10-24 01:16:13,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:13,771 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-24 01:16:13,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:13,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610265014] [2024-10-24 01:16:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610265014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:13,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:16:13,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345949788] [2024-10-24 01:16:13,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:13,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:16:13,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:16:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:16:13,776 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-24 01:16:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:16,289 INFO L93 Difference]: Finished difference Result 1192 states and 1975 transitions. [2024-10-24 01:16:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:16:16,289 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-24 01:16:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:16,293 INFO L225 Difference]: With dead ends: 1192 [2024-10-24 01:16:16,293 INFO L226 Difference]: Without dead ends: 886 [2024-10-24 01:16:16,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:16:16,295 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1367 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:16,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1120 Invalid, 2274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 01:16:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-24 01:16:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 647. [2024-10-24 01:16:16,332 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-24 01:16:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1055 transitions. [2024-10-24 01:16:16,336 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1055 transitions. Word has length 150 [2024-10-24 01:16:16,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:16,337 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 1055 transitions. [2024-10-24 01:16:16,337 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-24 01:16:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1055 transitions. [2024-10-24 01:16:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:16,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:16,339 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-24 01:16:16,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:16:16,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:16,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1324030094, now seen corresponding path program 1 times [2024-10-24 01:16:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:16,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295246404] [2024-10-24 01:16:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:16,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:16,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:16,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:16,611 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-24 01:16:16,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295246404] [2024-10-24 01:16:16,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295246404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:16,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:16,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:16,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578117480] [2024-10-24 01:16:16,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:16,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:16,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:16,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:16,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:16,615 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-24 01:16:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:19,712 INFO L93 Difference]: Finished difference Result 1977 states and 3277 transitions. [2024-10-24 01:16:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:19,713 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-24 01:16:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:19,720 INFO L225 Difference]: With dead ends: 1977 [2024-10-24 01:16:19,720 INFO L226 Difference]: Without dead ends: 1347 [2024-10-24 01:16:19,724 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-24 01:16:19,725 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 1398 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:19,726 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.4s Time] [2024-10-24 01:16:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-10-24 01:16:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 946. [2024-10-24 01:16:19,801 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-24 01:16:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1536 transitions. [2024-10-24 01:16:19,808 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1536 transitions. Word has length 150 [2024-10-24 01:16:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:19,808 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1536 transitions. [2024-10-24 01:16:19,809 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-24 01:16:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1536 transitions. [2024-10-24 01:16:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:19,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:19,811 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-24 01:16:19,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:16:19,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1999190220, now seen corresponding path program 1 times [2024-10-24 01:16:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772379053] [2024-10-24 01:16:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:19,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,072 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-24 01:16:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:20,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772379053] [2024-10-24 01:16:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772379053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:20,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585088632] [2024-10-24 01:16:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:20,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:20,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:20,075 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-24 01:16:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:22,893 INFO L93 Difference]: Finished difference Result 3127 states and 5172 transitions. [2024-10-24 01:16:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:22,896 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-24 01:16:22,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:22,904 INFO L225 Difference]: With dead ends: 3127 [2024-10-24 01:16:22,904 INFO L226 Difference]: Without dead ends: 2198 [2024-10-24 01:16:22,906 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-24 01:16:22,907 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1396 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3451 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:22,907 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.1s Time] [2024-10-24 01:16:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2024-10-24 01:16:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1545. [2024-10-24 01:16:22,982 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-24 01:16:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2503 transitions. [2024-10-24 01:16:22,989 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2503 transitions. Word has length 150 [2024-10-24 01:16:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2503 transitions. [2024-10-24 01:16:22,989 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-24 01:16:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2503 transitions. [2024-10-24 01:16:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:22,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:22,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:16:22,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:16:22,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1051138254, now seen corresponding path program 1 times [2024-10-24 01:16:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331439980] [2024-10-24 01:16:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:23,201 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-24 01:16:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331439980] [2024-10-24 01:16:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331439980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:23,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:23,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265032132] [2024-10-24 01:16:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:23,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:23,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:23,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:23,204 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-24 01:16:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:24,621 INFO L93 Difference]: Finished difference Result 3716 states and 6132 transitions. [2024-10-24 01:16:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:16:24,622 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-24 01:16:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:24,629 INFO L225 Difference]: With dead ends: 3716 [2024-10-24 01:16:24,629 INFO L226 Difference]: Without dead ends: 2188 [2024-10-24 01:16:24,632 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-24 01:16:24,633 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-24 01:16:24,634 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-24 01:16:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2024-10-24 01:16:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 1545. [2024-10-24 01:16:24,701 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-24 01:16:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2498 transitions. [2024-10-24 01:16:24,707 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2498 transitions. Word has length 150 [2024-10-24 01:16:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:24,707 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2498 transitions. [2024-10-24 01:16:24,707 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-24 01:16:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2498 transitions. [2024-10-24 01:16:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:24,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:24,709 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-24 01:16:24,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:16:24,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:24,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash 466366604, now seen corresponding path program 1 times [2024-10-24 01:16:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706666056] [2024-10-24 01:16:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:24,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:24,908 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-24 01:16:24,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:24,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706666056] [2024-10-24 01:16:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706666056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:24,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728397630] [2024-10-24 01:16:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:24,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:24,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:24,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:24,911 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-24 01:16:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:26,334 INFO L93 Difference]: Finished difference Result 3710 states and 6106 transitions. [2024-10-24 01:16:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:16:26,335 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-24 01:16:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:26,343 INFO L225 Difference]: With dead ends: 3710 [2024-10-24 01:16:26,343 INFO L226 Difference]: Without dead ends: 2182 [2024-10-24 01:16:26,349 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-24 01:16:26,350 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 997 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:26,351 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.1s Time] [2024-10-24 01:16:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2024-10-24 01:16:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 1545. [2024-10-24 01:16:26,436 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-24 01:16:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2493 transitions. [2024-10-24 01:16:26,443 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2493 transitions. Word has length 150 [2024-10-24 01:16:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:26,444 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2493 transitions. [2024-10-24 01:16:26,444 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-24 01:16:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2493 transitions. [2024-10-24 01:16:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:26,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:26,445 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-24 01:16:26,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:16:26,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:26,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:26,446 INFO L85 PathProgramCache]: Analyzing trace with hash 31861006, now seen corresponding path program 1 times [2024-10-24 01:16:26,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:26,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506027749] [2024-10-24 01:16:26,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:26,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:26,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:26,637 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-24 01:16:26,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:26,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506027749] [2024-10-24 01:16:26,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506027749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:26,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:26,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:26,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967643125] [2024-10-24 01:16:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:26,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:26,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:26,640 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-24 01:16:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:28,158 INFO L93 Difference]: Finished difference Result 3703 states and 6078 transitions. [2024-10-24 01:16:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:16:28,159 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-24 01:16:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:28,167 INFO L225 Difference]: With dead ends: 3703 [2024-10-24 01:16:28,167 INFO L226 Difference]: Without dead ends: 2175 [2024-10-24 01:16:28,171 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-24 01:16:28,172 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.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:28,172 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.2s Time] [2024-10-24 01:16:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2024-10-24 01:16:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 1545. [2024-10-24 01:16:28,258 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-24 01:16:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2488 transitions. [2024-10-24 01:16:28,262 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2488 transitions. Word has length 150 [2024-10-24 01:16:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:28,262 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2488 transitions. [2024-10-24 01:16:28,263 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-24 01:16:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2488 transitions. [2024-10-24 01:16:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:28,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:28,264 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-24 01:16:28,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:16:28,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:28,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash -397797300, now seen corresponding path program 1 times [2024-10-24 01:16:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:28,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328790818] [2024-10-24 01:16:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:28,464 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-24 01:16:28,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:28,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328790818] [2024-10-24 01:16:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328790818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:28,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:28,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107641366] [2024-10-24 01:16:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:28,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:28,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:28,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:28,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:28,466 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-24 01:16:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:29,724 INFO L93 Difference]: Finished difference Result 3691 states and 6040 transitions. [2024-10-24 01:16:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:16:29,725 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-24 01:16:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:29,734 INFO L225 Difference]: With dead ends: 3691 [2024-10-24 01:16:29,734 INFO L226 Difference]: Without dead ends: 2163 [2024-10-24 01:16:29,737 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-24 01:16:29,738 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-24 01:16:29,738 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-24 01:16:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2024-10-24 01:16:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1545. [2024-10-24 01:16:29,839 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-24 01:16:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2483 transitions. [2024-10-24 01:16:29,842 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2483 transitions. Word has length 150 [2024-10-24 01:16:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:29,843 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2483 transitions. [2024-10-24 01:16:29,843 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-24 01:16:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2483 transitions. [2024-10-24 01:16:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:29,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:29,844 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-24 01:16:29,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:16:29,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:29,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash 549240586, now seen corresponding path program 1 times [2024-10-24 01:16:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:29,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038507100] [2024-10-24 01:16:29,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:29,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:29,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:29,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:30,078 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-24 01:16:30,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:30,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038507100] [2024-10-24 01:16:30,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038507100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:30,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:30,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:30,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240183010] [2024-10-24 01:16:30,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:30,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:30,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:30,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:30,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:30,080 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-24 01:16:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:33,133 INFO L93 Difference]: Finished difference Result 5297 states and 8629 transitions. [2024-10-24 01:16:33,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:33,133 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-24 01:16:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:33,144 INFO L225 Difference]: With dead ends: 5297 [2024-10-24 01:16:33,144 INFO L226 Difference]: Without dead ends: 3769 [2024-10-24 01:16:33,147 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-24 01:16:33,147 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1367 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:33,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1855 Invalid, 3382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 01:16:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2024-10-24 01:16:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 2766. [2024-10-24 01:16:33,269 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-24 01:16:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4438 transitions. [2024-10-24 01:16:33,276 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4438 transitions. Word has length 150 [2024-10-24 01:16:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:33,277 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4438 transitions. [2024-10-24 01:16:33,277 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-24 01:16:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4438 transitions. [2024-10-24 01:16:33,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:33,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:33,279 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-24 01:16:33,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:16:33,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:33,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:33,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1411074188, now seen corresponding path program 1 times [2024-10-24 01:16:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:33,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262603805] [2024-10-24 01:16:33,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:33,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:33,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:33,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:33,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:33,480 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-24 01:16:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:33,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262603805] [2024-10-24 01:16:33,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262603805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:33,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:33,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145823385] [2024-10-24 01:16:33,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:33,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:33,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:33,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:33,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:33,483 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-24 01:16:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:36,494 INFO L93 Difference]: Finished difference Result 9702 states and 15780 transitions. [2024-10-24 01:16:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:36,494 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-24 01:16:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:36,519 INFO L225 Difference]: With dead ends: 9702 [2024-10-24 01:16:36,520 INFO L226 Difference]: Without dead ends: 6953 [2024-10-24 01:16:36,527 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-24 01:16:36,527 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1366 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3308 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:36,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 1855 Invalid, 3369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3308 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 01:16:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6953 states. [2024-10-24 01:16:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6953 to 5205. [2024-10-24 01:16:36,829 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-24 01:16:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 8356 transitions. [2024-10-24 01:16:36,843 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 8356 transitions. Word has length 150 [2024-10-24 01:16:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:36,843 INFO L471 AbstractCegarLoop]: Abstraction has 5205 states and 8356 transitions. [2024-10-24 01:16:36,844 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-24 01:16:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 8356 transitions. [2024-10-24 01:16:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:36,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:36,847 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-24 01:16:36,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:16:36,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:36,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash -639334710, now seen corresponding path program 1 times [2024-10-24 01:16:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:36,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027733075] [2024-10-24 01:16:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:37,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:37,055 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-24 01:16:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:37,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027733075] [2024-10-24 01:16:37,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027733075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:37,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669902108] [2024-10-24 01:16:37,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:37,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:37,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:37,057 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-24 01:16:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:40,102 INFO L93 Difference]: Finished difference Result 18503 states and 30124 transitions. [2024-10-24 01:16:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:16:40,102 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-24 01:16:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:40,155 INFO L225 Difference]: With dead ends: 18503 [2024-10-24 01:16:40,155 INFO L226 Difference]: Without dead ends: 13315 [2024-10-24 01:16:40,169 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-24 01:16:40,169 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.9s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:40,170 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.9s Time] [2024-10-24 01:16:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13315 states. [2024-10-24 01:16:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13315 to 10098. [2024-10-24 01:16:40,768 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-24 01:16:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 16268 transitions. [2024-10-24 01:16:40,794 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 16268 transitions. Word has length 150 [2024-10-24 01:16:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:40,794 INFO L471 AbstractCegarLoop]: Abstraction has 10098 states and 16268 transitions. [2024-10-24 01:16:40,795 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-24 01:16:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 16268 transitions. [2024-10-24 01:16:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:40,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:40,801 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-24 01:16:40,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:16:40,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:40,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash -151287604, now seen corresponding path program 1 times [2024-10-24 01:16:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:40,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665620406] [2024-10-24 01:16:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:40,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:40,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:40,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:40,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:41,001 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-24 01:16:41,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:41,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665620406] [2024-10-24 01:16:41,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665620406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:41,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:41,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60753052] [2024-10-24 01:16:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:41,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:41,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:41,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:41,004 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-24 01:16:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:42,990 INFO L93 Difference]: Finished difference Result 23561 states and 38573 transitions. [2024-10-24 01:16:42,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:16:42,991 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-24 01:16:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:43,030 INFO L225 Difference]: With dead ends: 23561 [2024-10-24 01:16:43,031 INFO L226 Difference]: Without dead ends: 13480 [2024-10-24 01:16:43,053 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-24 01:16:43,053 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-24 01:16:43,054 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-24 01:16:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13480 states. [2024-10-24 01:16:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13480 to 10098. [2024-10-24 01:16:43,641 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-24 01:16:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 16235 transitions. [2024-10-24 01:16:43,668 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 16235 transitions. Word has length 150 [2024-10-24 01:16:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:43,669 INFO L471 AbstractCegarLoop]: Abstraction has 10098 states and 16235 transitions. [2024-10-24 01:16:43,670 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-24 01:16:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 16235 transitions. [2024-10-24 01:16:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:43,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:43,676 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-24 01:16:43,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:16:43,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:43,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:43,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1243922806, now seen corresponding path program 1 times [2024-10-24 01:16:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:43,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081930747] [2024-10-24 01:16:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:43,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:43,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:43,843 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-24 01:16:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081930747] [2024-10-24 01:16:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081930747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:43,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89285865] [2024-10-24 01:16:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:43,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:43,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:43,845 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-24 01:16:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:48,063 INFO L93 Difference]: Finished difference Result 40552 states and 66040 transitions. [2024-10-24 01:16:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:16:48,063 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-24 01:16:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:48,160 INFO L225 Difference]: With dead ends: 40552 [2024-10-24 01:16:48,160 INFO L226 Difference]: Without dead ends: 30471 [2024-10-24 01:16:48,189 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-24 01:16:48,190 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1756 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:48,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 1848 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3247 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 01:16:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30471 states. [2024-10-24 01:16:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30471 to 19884. [2024-10-24 01:16:49,304 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-24 01:16:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19884 states to 19884 states and 32173 transitions. [2024-10-24 01:16:49,464 INFO L78 Accepts]: Start accepts. Automaton has 19884 states and 32173 transitions. Word has length 150 [2024-10-24 01:16:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:49,464 INFO L471 AbstractCegarLoop]: Abstraction has 19884 states and 32173 transitions. [2024-10-24 01:16:49,465 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-24 01:16:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 19884 states and 32173 transitions. [2024-10-24 01:16:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:49,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:49,476 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-24 01:16:49,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:16:49,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:49,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:49,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1768872204, now seen corresponding path program 1 times [2024-10-24 01:16:49,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:49,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437323062] [2024-10-24 01:16:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:49,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:49,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:49,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:49,661 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-24 01:16:49,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:49,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437323062] [2024-10-24 01:16:49,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437323062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:49,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:49,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:49,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062349635] [2024-10-24 01:16:49,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:49,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:49,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:49,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:49,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:49,662 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-24 01:16:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:56,062 INFO L93 Difference]: Finished difference Result 79344 states and 130040 transitions. [2024-10-24 01:16:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:16:56,062 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-24 01:16:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:56,240 INFO L225 Difference]: With dead ends: 79344 [2024-10-24 01:16:56,241 INFO L226 Difference]: Without dead ends: 59477 [2024-10-24 01:16:56,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:16:56,293 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1453 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 3849 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:56,293 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.4s Time] [2024-10-24 01:16:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59477 states. [2024-10-24 01:16:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59477 to 39133. [2024-10-24 01:16:59,353 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-24 01:16:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39133 states to 39133 states and 64017 transitions. [2024-10-24 01:16:59,506 INFO L78 Accepts]: Start accepts. Automaton has 39133 states and 64017 transitions. Word has length 150 [2024-10-24 01:16:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:59,507 INFO L471 AbstractCegarLoop]: Abstraction has 39133 states and 64017 transitions. [2024-10-24 01:16:59,507 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-24 01:16:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 39133 states and 64017 transitions. [2024-10-24 01:16:59,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:16:59,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:59,531 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-24 01:16:59,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:16:59,532 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:59,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash -73603510, now seen corresponding path program 1 times [2024-10-24 01:16:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:59,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502276550] [2024-10-24 01:16:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:59,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:16:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:16:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:16:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:16:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:16:59,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:59,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502276550] [2024-10-24 01:16:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502276550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:59,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:59,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:16:59,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69935239] [2024-10-24 01:16:59,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:59,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:16:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:59,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:16:59,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:59,910 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-24 01:17:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:08,690 INFO L93 Difference]: Finished difference Result 153405 states and 254218 transitions. [2024-10-24 01:17:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:17:08,690 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-24 01:17:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:09,097 INFO L225 Difference]: With dead ends: 153405 [2024-10-24 01:17:09,098 INFO L226 Difference]: Without dead ends: 114289 [2024-10-24 01:17:09,203 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-24 01:17:09,204 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1651 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3202 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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-24 01:17:09,204 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-24 01:17:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114289 states. [2024-10-24 01:17:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114289 to 78079. [2024-10-24 01:17:14,386 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-24 01:17:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78079 states to 78079 states and 129931 transitions. [2024-10-24 01:17:14,815 INFO L78 Accepts]: Start accepts. Automaton has 78079 states and 129931 transitions. Word has length 150 [2024-10-24 01:17:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:14,816 INFO L471 AbstractCegarLoop]: Abstraction has 78079 states and 129931 transitions. [2024-10-24 01:17:14,816 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-24 01:17:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 78079 states and 129931 transitions. [2024-10-24 01:17:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:17:14,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:14,853 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-24 01:17:14,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:17:14,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:14,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash -406246648, now seen corresponding path program 1 times [2024-10-24 01:17:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:14,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768867458] [2024-10-24 01:17:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:14,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:14,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 01:17:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:17:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:17:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 01:17:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:15,019 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-24 01:17:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768867458] [2024-10-24 01:17:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768867458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:15,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:15,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:15,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635741186] [2024-10-24 01:17:15,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:15,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:15,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:15,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:15,021 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)