./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.05.cil-1.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 a75784c0f203c4a6f14019aef9d9a89ba63a0efbe594dc5cdecfb5d06e7619f2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:29:05,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:29:05,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:29:05,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:29:05,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:29:05,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:29:05,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:29:05,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:29:05,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:29:05,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:29:05,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:29:05,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:29:05,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:29:05,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:29:05,184 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:29:05,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:29:05,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:29:05,185 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:29:05,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:29:05,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:29:05,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:29:05,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:29:05,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:29:05,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:29:05,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:29:05,189 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:29:05,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:29:05,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:29:05,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:29:05,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:29:05,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:29:05,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:29:05,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:29:05,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:29:05,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:29:05,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:29:05,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:29:05,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:29:05,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:29:05,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:29:05,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:29:05,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:29:05,192 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 -> a75784c0f203c4a6f14019aef9d9a89ba63a0efbe594dc5cdecfb5d06e7619f2 [2024-11-08 15:29:05,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:29:05,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:29:05,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:29:05,411 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:29:05,411 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:29:05,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.05.cil-1.c [2024-11-08 15:29:06,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:29:06,763 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:29:06,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c [2024-11-08 15:29:06,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b067a68f/b7353c2365ed480d80d1d12d9bcd5fe1/FLAGf71593ccc [2024-11-08 15:29:06,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b067a68f/b7353c2365ed480d80d1d12d9bcd5fe1 [2024-11-08 15:29:06,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:29:06,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:29:06,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:29:06,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:29:06,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:29:06,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:29:06" (1/1) ... [2024-11-08 15:29:06,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59447f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:06, skipping insertion in model container [2024-11-08 15:29:06,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:29:06" (1/1) ... [2024-11-08 15:29:06,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:29:06,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c[671,684] [2024-11-08 15:29:07,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:29:07,090 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:29:07,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c[671,684] [2024-11-08 15:29:07,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:29:07,164 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:29:07,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07 WrapperNode [2024-11-08 15:29:07,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:29:07,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:29:07,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:29:07,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:29:07,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,216 INFO L138 Inliner]: procedures = 38, calls = 46, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 459 [2024-11-08 15:29:07,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:29:07,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:29:07,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:29:07,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:29:07,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,246 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:29:07,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:29:07,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:29:07,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:29:07,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:29:07,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (1/1) ... [2024-11-08 15:29:07,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:29:07,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:29:07,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:29:07,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:29:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:29:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-08 15:29:07,355 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-08 15:29:07,356 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-08 15:29:07,356 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-08 15:29:07,356 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-08 15:29:07,357 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-08 15:29:07,357 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-08 15:29:07,358 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-08 15:29:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-08 15:29:07,358 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-08 15:29:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:29:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-08 15:29:07,359 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-08 15:29:07,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:29:07,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:29:07,431 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:29:07,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:29:07,844 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-08 15:29:07,844 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:29:07,856 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:29:07,856 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-08 15:29:07,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:29:07 BoogieIcfgContainer [2024-11-08 15:29:07,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:29:07,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:29:07,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:29:07,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:29:07,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:29:06" (1/3) ... [2024-11-08 15:29:07,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9892d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:29:07, skipping insertion in model container [2024-11-08 15:29:07,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:29:07" (2/3) ... [2024-11-08 15:29:07,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9892d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:29:07, skipping insertion in model container [2024-11-08 15:29:07,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:29:07" (3/3) ... [2024-11-08 15:29:07,863 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-1.c [2024-11-08 15:29:07,875 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:29:07,875 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:29:07,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:29:07,941 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;@6313b498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:29:07,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:29:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 188 states have internal predecessors, (298), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 15:29:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:07,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:07,957 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] [2024-11-08 15:29:07,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:07,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -331575046, now seen corresponding path program 1 times [2024-11-08 15:29:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:07,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177705203] [2024-11-08 15:29:07,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:08,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:08,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:08,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:08,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:08,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:08,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:08,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177705203] [2024-11-08 15:29:08,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177705203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:08,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:29:08,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567578075] [2024-11-08 15:29:08,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:08,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:29:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:08,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:29:08,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:29:08,593 INFO L87 Difference]: Start difference. First operand has 213 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 188 states have internal predecessors, (298), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:09,851 INFO L93 Difference]: Finished difference Result 745 states and 1197 transitions. [2024-11-08 15:29:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:29:09,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:09,866 INFO L225 Difference]: With dead ends: 745 [2024-11-08 15:29:09,866 INFO L226 Difference]: Without dead ends: 537 [2024-11-08 15:29:09,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:29:09,874 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 767 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:09,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 745 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 15:29:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-08 15:29:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 408. [2024-11-08 15:29:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 361 states have (on average 1.5263157894736843) internal successors, (551), 363 states have internal predecessors, (551), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-11-08 15:29:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 620 transitions. [2024-11-08 15:29:09,959 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 620 transitions. Word has length 100 [2024-11-08 15:29:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:09,959 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 620 transitions. [2024-11-08 15:29:09,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 620 transitions. [2024-11-08 15:29:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:09,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:09,962 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] [2024-11-08 15:29:09,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:29:09,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:09,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2048459650, now seen corresponding path program 1 times [2024-11-08 15:29:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:09,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375381004] [2024-11-08 15:29:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:10,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:10,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:10,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:10,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:10,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:10,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375381004] [2024-11-08 15:29:10,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375381004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:10,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:10,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:10,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151232489] [2024-11-08 15:29:10,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:10,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:10,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:10,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:10,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:10,169 INFO L87 Difference]: Start difference. First operand 408 states and 620 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:11,585 INFO L93 Difference]: Finished difference Result 1202 states and 1856 transitions. [2024-11-08 15:29:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:29:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:11,590 INFO L225 Difference]: With dead ends: 1202 [2024-11-08 15:29:11,590 INFO L226 Difference]: Without dead ends: 807 [2024-11-08 15:29:11,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:29:11,593 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 768 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:11,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1345 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 15:29:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-08 15:29:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 595. [2024-11-08 15:29:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 527 states have (on average 1.5180265654648957) internal successors, (800), 530 states have internal predecessors, (800), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-11-08 15:29:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 899 transitions. [2024-11-08 15:29:11,642 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 899 transitions. Word has length 100 [2024-11-08 15:29:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:11,642 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 899 transitions. [2024-11-08 15:29:11,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 899 transitions. [2024-11-08 15:29:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:11,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:11,648 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] [2024-11-08 15:29:11,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:29:11,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:11,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash 367376700, now seen corresponding path program 1 times [2024-11-08 15:29:11,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:11,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270881832] [2024-11-08 15:29:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:11,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:11,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270881832] [2024-11-08 15:29:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270881832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:11,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656665518] [2024-11-08 15:29:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:11,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:11,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:11,852 INFO L87 Difference]: Start difference. First operand 595 states and 899 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:13,183 INFO L93 Difference]: Finished difference Result 1894 states and 2915 transitions. [2024-11-08 15:29:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:29:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:13,193 INFO L225 Difference]: With dead ends: 1894 [2024-11-08 15:29:13,197 INFO L226 Difference]: Without dead ends: 1312 [2024-11-08 15:29:13,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:29:13,199 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 766 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:13,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 1343 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 15:29:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-08 15:29:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 970. [2024-11-08 15:29:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 860 states have (on average 1.5104651162790699) internal successors, (1299), 865 states have internal predecessors, (1299), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-11-08 15:29:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1462 transitions. [2024-11-08 15:29:13,245 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1462 transitions. Word has length 100 [2024-11-08 15:29:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:13,247 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1462 transitions. [2024-11-08 15:29:13,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1462 transitions. [2024-11-08 15:29:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:13,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:13,252 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] [2024-11-08 15:29:13,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:29:13,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:13,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1692232894, now seen corresponding path program 1 times [2024-11-08 15:29:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610937692] [2024-11-08 15:29:13,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:13,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:13,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610937692] [2024-11-08 15:29:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610937692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:13,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:13,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304174739] [2024-11-08 15:29:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:13,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:13,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:13,382 INFO L87 Difference]: Start difference. First operand 970 states and 1462 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:14,696 INFO L93 Difference]: Finished difference Result 3229 states and 4950 transitions. [2024-11-08 15:29:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:29:14,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:14,708 INFO L225 Difference]: With dead ends: 3229 [2024-11-08 15:29:14,708 INFO L226 Difference]: Without dead ends: 2272 [2024-11-08 15:29:14,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:29:14,713 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 762 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:14,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1343 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 15:29:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2024-11-08 15:29:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1721. [2024-11-08 15:29:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1527 states have (on average 1.504256712508186) internal successors, (2297), 1536 states have internal predecessors, (2297), 131 states have call successors, (131), 54 states have call predecessors, (131), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-11-08 15:29:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2594 transitions. [2024-11-08 15:29:14,810 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2594 transitions. Word has length 100 [2024-11-08 15:29:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:14,810 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2594 transitions. [2024-11-08 15:29:14,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2594 transitions. [2024-11-08 15:29:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:14,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:14,813 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] [2024-11-08 15:29:14,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:29:14,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:14,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1035976452, now seen corresponding path program 1 times [2024-11-08 15:29:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:14,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760501834] [2024-11-08 15:29:14,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:14,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:14,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:14,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:14,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:14,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760501834] [2024-11-08 15:29:14,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760501834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:14,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:14,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:14,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069467932] [2024-11-08 15:29:14,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:14,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:14,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:14,959 INFO L87 Difference]: Start difference. First operand 1721 states and 2594 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:16,315 INFO L93 Difference]: Finished difference Result 5898 states and 9036 transitions. [2024-11-08 15:29:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:29:16,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:16,330 INFO L225 Difference]: With dead ends: 5898 [2024-11-08 15:29:16,330 INFO L226 Difference]: Without dead ends: 4190 [2024-11-08 15:29:16,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:29:16,334 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 764 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:16,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1343 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 15:29:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2024-11-08 15:29:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 3228. [2024-11-08 15:29:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 2866 states have (on average 1.5) internal successors, (4299), 2883 states have internal predecessors, (4299), 243 states have call successors, (243), 102 states have call predecessors, (243), 118 states have return successors, (340), 258 states have call predecessors, (340), 243 states have call successors, (340) [2024-11-08 15:29:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 4882 transitions. [2024-11-08 15:29:16,498 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 4882 transitions. Word has length 100 [2024-11-08 15:29:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:16,498 INFO L471 AbstractCegarLoop]: Abstraction has 3228 states and 4882 transitions. [2024-11-08 15:29:16,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 4882 transitions. [2024-11-08 15:29:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:16,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:16,501 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] [2024-11-08 15:29:16,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:29:16,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:16,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2093814530, now seen corresponding path program 1 times [2024-11-08 15:29:16,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:16,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891409381] [2024-11-08 15:29:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:16,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:16,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891409381] [2024-11-08 15:29:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891409381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:16,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:16,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667895280] [2024-11-08 15:29:16,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:16,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:16,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:16,624 INFO L87 Difference]: Start difference. First operand 3228 states and 4882 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:17,919 INFO L93 Difference]: Finished difference Result 12484 states and 19128 transitions. [2024-11-08 15:29:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:29:17,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:17,956 INFO L225 Difference]: With dead ends: 12484 [2024-11-08 15:29:17,956 INFO L226 Difference]: Without dead ends: 9269 [2024-11-08 15:29:17,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:29:17,966 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1032 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:17,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 881 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 15:29:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9269 states. [2024-11-08 15:29:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9269 to 6224. [2024-11-08 15:29:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6224 states, 5542 states have (on average 1.5018044027426922) internal successors, (8323), 5575 states have internal predecessors, (8323), 451 states have call successors, (451), 198 states have call predecessors, (451), 230 states have return successors, (726), 482 states have call predecessors, (726), 451 states have call successors, (726) [2024-11-08 15:29:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 9500 transitions. [2024-11-08 15:29:18,291 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 9500 transitions. Word has length 100 [2024-11-08 15:29:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:18,291 INFO L471 AbstractCegarLoop]: Abstraction has 6224 states and 9500 transitions. [2024-11-08 15:29:18,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 9500 transitions. [2024-11-08 15:29:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:18,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:18,300 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] [2024-11-08 15:29:18,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:29:18,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:18,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1853574784, now seen corresponding path program 1 times [2024-11-08 15:29:18,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:18,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59847743] [2024-11-08 15:29:18,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:18,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:18,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:18,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59847743] [2024-11-08 15:29:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59847743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:18,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478247956] [2024-11-08 15:29:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:18,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:18,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:18,421 INFO L87 Difference]: Start difference. First operand 6224 states and 9500 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:20,210 INFO L93 Difference]: Finished difference Result 23898 states and 36876 transitions. [2024-11-08 15:29:20,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:29:20,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:20,304 INFO L225 Difference]: With dead ends: 23898 [2024-11-08 15:29:20,304 INFO L226 Difference]: Without dead ends: 17687 [2024-11-08 15:29:20,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:29:20,323 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 801 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:20,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1329 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 15:29:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17687 states. [2024-11-08 15:29:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17687 to 12037. [2024-11-08 15:29:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12037 states, 10731 states have (on average 1.5026558568632933) internal successors, (16125), 10796 states have internal predecessors, (16125), 851 states have call successors, (851), 390 states have call predecessors, (851), 454 states have return successors, (1644), 914 states have call predecessors, (1644), 851 states have call successors, (1644) [2024-11-08 15:29:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12037 states to 12037 states and 18620 transitions. [2024-11-08 15:29:21,036 INFO L78 Accepts]: Start accepts. Automaton has 12037 states and 18620 transitions. Word has length 100 [2024-11-08 15:29:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:21,038 INFO L471 AbstractCegarLoop]: Abstraction has 12037 states and 18620 transitions. [2024-11-08 15:29:21,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 12037 states and 18620 transitions. [2024-11-08 15:29:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:21,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:21,050 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] [2024-11-08 15:29:21,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:29:21,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:21,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1014541122, now seen corresponding path program 1 times [2024-11-08 15:29:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433790727] [2024-11-08 15:29:21,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:21,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:21,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:21,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433790727] [2024-11-08 15:29:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433790727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:21,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:21,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:21,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743421960] [2024-11-08 15:29:21,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:21,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:21,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:21,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:21,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:21,223 INFO L87 Difference]: Start difference. First operand 12037 states and 18620 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:23,555 INFO L93 Difference]: Finished difference Result 45653 states and 71274 transitions. [2024-11-08 15:29:23,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:29:23,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:23,666 INFO L225 Difference]: With dead ends: 45653 [2024-11-08 15:29:23,666 INFO L226 Difference]: Without dead ends: 33629 [2024-11-08 15:29:23,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:29:23,713 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 893 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:23,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1333 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 15:29:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33629 states. [2024-11-08 15:29:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33629 to 23790. [2024-11-08 15:29:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23790 states, 21268 states have (on average 1.5053131465111904) internal successors, (32015), 21397 states have internal predecessors, (32015), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-11-08 15:29:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23790 states to 23790 states and 37568 transitions. [2024-11-08 15:29:25,046 INFO L78 Accepts]: Start accepts. Automaton has 23790 states and 37568 transitions. Word has length 100 [2024-11-08 15:29:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:25,046 INFO L471 AbstractCegarLoop]: Abstraction has 23790 states and 37568 transitions. [2024-11-08 15:29:25,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23790 states and 37568 transitions. [2024-11-08 15:29:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:25,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:25,060 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] [2024-11-08 15:29:25,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:29:25,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:25,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash -987475520, now seen corresponding path program 1 times [2024-11-08 15:29:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267414657] [2024-11-08 15:29:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:25,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:25,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:25,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:25,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:25,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:25,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267414657] [2024-11-08 15:29:25,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267414657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:25,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:25,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:25,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828944006] [2024-11-08 15:29:25,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:25,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:25,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:25,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:25,174 INFO L87 Difference]: Start difference. First operand 23790 states and 37568 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:28,852 INFO L93 Difference]: Finished difference Result 88396 states and 140832 transitions. [2024-11-08 15:29:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:29:28,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:29,065 INFO L225 Difference]: With dead ends: 88396 [2024-11-08 15:29:29,066 INFO L226 Difference]: Without dead ends: 64619 [2024-11-08 15:29:29,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:29:29,133 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 853 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:29,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1333 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 15:29:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64619 states. [2024-11-08 15:29:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64619 to 47231. [2024-11-08 15:29:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47231 states, 42341 states have (on average 1.5081599395385088) internal successors, (63857), 42598 states have internal predecessors, (63857), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 1798 states have return successors, (9908), 3346 states have call predecessors, (9908), 3091 states have call successors, (9908) [2024-11-08 15:29:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47231 states to 47231 states and 76856 transitions. [2024-11-08 15:29:31,744 INFO L78 Accepts]: Start accepts. Automaton has 47231 states and 76856 transitions. Word has length 100 [2024-11-08 15:29:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:31,745 INFO L471 AbstractCegarLoop]: Abstraction has 47231 states and 76856 transitions. [2024-11-08 15:29:31,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 47231 states and 76856 transitions. [2024-11-08 15:29:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:31,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:31,774 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] [2024-11-08 15:29:31,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:29:31,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:31,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1230154878, now seen corresponding path program 1 times [2024-11-08 15:29:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076142879] [2024-11-08 15:29:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:31,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:31,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:31,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076142879] [2024-11-08 15:29:31,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076142879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:31,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:31,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:31,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568455394] [2024-11-08 15:29:31,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:31,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:31,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:31,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:31,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:31,903 INFO L87 Difference]: Start difference. First operand 47231 states and 76856 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:29:38,947 INFO L93 Difference]: Finished difference Result 171515 states and 282006 transitions. [2024-11-08 15:29:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:29:38,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-11-08 15:29:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:29:39,487 INFO L225 Difference]: With dead ends: 171515 [2024-11-08 15:29:39,487 INFO L226 Difference]: Without dead ends: 124297 [2024-11-08 15:29:39,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:29:39,640 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 769 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:29:39,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1333 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 15:29:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124297 states. [2024-11-08 15:29:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124297 to 93984. [2024-11-08 15:29:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93984 states, 84486 states have (on average 1.5111024311720285) internal successors, (127667), 84999 states have internal predecessors, (127667), 5907 states have call successors, (5907), 3078 states have call predecessors, (5907), 3590 states have return successors, (26102), 6418 states have call predecessors, (26102), 5907 states have call successors, (26102) [2024-11-08 15:29:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93984 states to 93984 states and 159676 transitions. [2024-11-08 15:29:45,028 INFO L78 Accepts]: Start accepts. Automaton has 93984 states and 159676 transitions. Word has length 100 [2024-11-08 15:29:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:29:45,028 INFO L471 AbstractCegarLoop]: Abstraction has 93984 states and 159676 transitions. [2024-11-08 15:29:45,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:29:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 93984 states and 159676 transitions. [2024-11-08 15:29:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:29:45,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:29:45,101 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] [2024-11-08 15:29:45,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:29:45,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:29:45,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:29:45,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1330707968, now seen corresponding path program 1 times [2024-11-08 15:29:45,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:29:45,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875577347] [2024-11-08 15:29:45,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:29:45,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:29:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:45,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:29:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:29:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:29:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:45,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:29:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:29:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:29:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:29:45,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:29:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875577347] [2024-11-08 15:29:45,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875577347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:29:45,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:29:45,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:29:45,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592900140] [2024-11-08 15:29:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:29:45,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:29:45,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:29:45,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:29:45,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:29:45,232 INFO L87 Difference]: Start difference. First operand 93984 states and 159676 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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)