./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:08:13,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:08:13,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:08:13,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:08:13,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:08:13,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:08:13,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:08:13,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:08:13,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:08:13,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:08:13,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:08:13,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:08:13,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:08:13,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:08:13,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:08:13,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:08:13,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:08:13,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:08:13,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:08:13,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:08:13,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:08:13,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:08:13,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:08:13,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:08:13,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:08:13,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:08:13,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:08:13,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:08:13,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:08:13,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:08:13,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:08:13,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:08:13,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:08:13,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:08:13,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:08:13,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:08:13,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:08:13,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:08:13,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:08:13,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:08:13,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:08:13,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:08:13,415 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-11 21:08:13,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:08:13,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:08:13,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:08:13,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:08:13,663 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:08:13,664 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-11 21:08:15,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:08:15,222 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:08:15,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c [2024-11-11 21:08:15,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd36eeea2/9dd6d0d52432417683b778854f659145/FLAGe03f9078f [2024-11-11 21:08:15,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd36eeea2/9dd6d0d52432417683b778854f659145 [2024-11-11 21:08:15,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:08:15,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:08:15,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:08:15,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:08:15,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:08:15,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:15,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17054637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15, skipping insertion in model container [2024-11-11 21:08:15,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:15,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:08:15,798 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-11 21:08:15,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:08:15,880 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:08:15,889 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-11 21:08:15,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:08:15,933 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:08:15,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15 WrapperNode [2024-11-11 21:08:15,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:08:15,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:08:15,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:08:15,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:08:15,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:15,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:15,974 INFO L138 Inliner]: procedures = 38, calls = 46, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 459 [2024-11-11 21:08:15,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:08:15,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:08:15,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:08:15,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:08:15,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:15,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:15,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:16,017 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-11 21:08:16,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:16,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:16,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:16,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:16,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:16,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:16,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:08:16,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:08:16,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:08:16,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:08:16,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (1/1) ... [2024-11-11 21:08:16,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:08:16,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:08:16,093 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-11 21:08:16,101 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-11 21:08:16,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:08:16,146 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 21:08:16,147 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 21:08:16,147 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 21:08:16,147 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 21:08:16,147 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 21:08:16,147 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 21:08:16,147 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 21:08:16,149 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 21:08:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 21:08:16,149 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 21:08:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:08:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 21:08:16,149 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 21:08:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:08:16,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:08:16,261 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:08:16,263 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:08:16,683 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-11 21:08:16,683 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:08:16,701 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:08:16,702 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-11 21:08:16,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:08:16 BoogieIcfgContainer [2024-11-11 21:08:16,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:08:16,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:08:16,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:08:16,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:08:16,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:08:15" (1/3) ... [2024-11-11 21:08:16,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17814abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:08:16, skipping insertion in model container [2024-11-11 21:08:16,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:15" (2/3) ... [2024-11-11 21:08:16,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17814abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:08:16, skipping insertion in model container [2024-11-11 21:08:16,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:08:16" (3/3) ... [2024-11-11 21:08:16,710 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-1.c [2024-11-11 21:08:16,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:08:16,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:08:16,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:08:16,786 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;@acef5b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:08:16,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:08:16,790 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-11 21:08:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:16,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:16,800 INFO L218 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-11 21:08:16,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:16,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash -331575046, now seen corresponding path program 1 times [2024-11-11 21:08:16,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:16,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228060193] [2024-11-11 21:08:16,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:16,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:17,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:17,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:17,299 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-11 21:08:17,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228060193] [2024-11-11 21:08:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228060193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:17,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:17,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:08:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885868512] [2024-11-11 21:08:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:17,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:08:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:17,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:08:17,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:08:17,401 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-11 21:08:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:18,789 INFO L93 Difference]: Finished difference Result 745 states and 1197 transitions. [2024-11-11 21:08:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:08:18,794 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-11 21:08:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:18,810 INFO L225 Difference]: With dead ends: 745 [2024-11-11 21:08:18,811 INFO L226 Difference]: Without dead ends: 537 [2024-11-11 21:08:18,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:08:18,824 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 767 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:18,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 745 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:08:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-11 21:08:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 408. [2024-11-11 21:08:18,889 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-11 21:08:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 620 transitions. [2024-11-11 21:08:18,893 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 620 transitions. Word has length 100 [2024-11-11 21:08:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:18,893 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 620 transitions. [2024-11-11 21:08:18,894 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-11 21:08:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 620 transitions. [2024-11-11 21:08:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:18,896 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:18,896 INFO L218 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-11 21:08:18,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:08:18,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:18,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:18,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2048459650, now seen corresponding path program 1 times [2024-11-11 21:08:18,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629366732] [2024-11-11 21:08:18,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:19,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:19,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:19,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:19,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:19,119 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-11 21:08:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:19,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629366732] [2024-11-11 21:08:19,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629366732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:19,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:19,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222451415] [2024-11-11 21:08:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:19,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:19,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:19,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:19,123 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-11 21:08:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:20,480 INFO L93 Difference]: Finished difference Result 1202 states and 1856 transitions. [2024-11-11 21:08:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:08:20,481 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-11 21:08:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:20,486 INFO L225 Difference]: With dead ends: 1202 [2024-11-11 21:08:20,486 INFO L226 Difference]: Without dead ends: 807 [2024-11-11 21:08:20,487 INFO L434 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-11 21:08:20,488 INFO L435 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-11 21:08:20,489 INFO L436 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-11 21:08:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-11 21:08:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 595. [2024-11-11 21:08:20,550 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-11 21:08:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 899 transitions. [2024-11-11 21:08:20,555 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 899 transitions. Word has length 100 [2024-11-11 21:08:20,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:20,555 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 899 transitions. [2024-11-11 21:08:20,556 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-11 21:08:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 899 transitions. [2024-11-11 21:08:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:20,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:20,561 INFO L218 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-11 21:08:20,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:08:20,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:20,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash 367376700, now seen corresponding path program 1 times [2024-11-11 21:08:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968038272] [2024-11-11 21:08:20,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:20,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:20,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:20,786 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-11 21:08:20,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968038272] [2024-11-11 21:08:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968038272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620093631] [2024-11-11 21:08:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:20,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:20,790 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-11 21:08:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:22,193 INFO L93 Difference]: Finished difference Result 1894 states and 2915 transitions. [2024-11-11 21:08:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:08:22,194 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-11 21:08:22,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:22,200 INFO L225 Difference]: With dead ends: 1894 [2024-11-11 21:08:22,200 INFO L226 Difference]: Without dead ends: 1312 [2024-11-11 21:08:22,202 INFO L434 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-11 21:08:22,203 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 766 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:22,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 1343 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:08:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-11 21:08:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 970. [2024-11-11 21:08:22,265 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-11 21:08:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1462 transitions. [2024-11-11 21:08:22,269 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1462 transitions. Word has length 100 [2024-11-11 21:08:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:22,270 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1462 transitions. [2024-11-11 21:08:22,270 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-11 21:08:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1462 transitions. [2024-11-11 21:08:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:22,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:22,275 INFO L218 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-11 21:08:22,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:08:22,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:22,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1692232894, now seen corresponding path program 1 times [2024-11-11 21:08:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:22,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32045105] [2024-11-11 21:08:22,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:22,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:22,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:22,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:08:22,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:22,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32045105] [2024-11-11 21:08:22,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32045105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:22,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:22,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:22,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946637509] [2024-11-11 21:08:22,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:22,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:22,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:22,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:22,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:22,429 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-11 21:08:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:23,817 INFO L93 Difference]: Finished difference Result 3229 states and 4950 transitions. [2024-11-11 21:08:23,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:08:23,818 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-11 21:08:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:23,828 INFO L225 Difference]: With dead ends: 3229 [2024-11-11 21:08:23,828 INFO L226 Difference]: Without dead ends: 2272 [2024-11-11 21:08:23,832 INFO L434 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-11 21:08:23,833 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 762 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:23,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1343 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:08:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2024-11-11 21:08:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1721. [2024-11-11 21:08:23,950 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-11 21:08:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2594 transitions. [2024-11-11 21:08:23,957 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2594 transitions. Word has length 100 [2024-11-11 21:08:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:23,958 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2594 transitions. [2024-11-11 21:08:23,958 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-11 21:08:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2594 transitions. [2024-11-11 21:08:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:23,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:23,960 INFO L218 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-11 21:08:23,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:08:23,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:23,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1035976452, now seen corresponding path program 1 times [2024-11-11 21:08:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823693425] [2024-11-11 21:08:23,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:24,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:24,154 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-11 21:08:24,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:24,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823693425] [2024-11-11 21:08:24,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823693425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:24,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:24,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:24,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41130026] [2024-11-11 21:08:24,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:24,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:24,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:24,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:24,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:24,159 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-11 21:08:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:25,562 INFO L93 Difference]: Finished difference Result 5898 states and 9036 transitions. [2024-11-11 21:08:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:08:25,563 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-11 21:08:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:25,579 INFO L225 Difference]: With dead ends: 5898 [2024-11-11 21:08:25,579 INFO L226 Difference]: Without dead ends: 4190 [2024-11-11 21:08:25,583 INFO L434 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-11 21:08:25,584 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 764 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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-11 21:08:25,585 INFO L436 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-11 21:08:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2024-11-11 21:08:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 3228. [2024-11-11 21:08:25,791 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-11 21:08:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 4882 transitions. [2024-11-11 21:08:25,801 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 4882 transitions. Word has length 100 [2024-11-11 21:08:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:25,802 INFO L471 AbstractCegarLoop]: Abstraction has 3228 states and 4882 transitions. [2024-11-11 21:08:25,802 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-11 21:08:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 4882 transitions. [2024-11-11 21:08:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:25,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:25,805 INFO L218 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-11 21:08:25,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:08:25,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:25,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2093814530, now seen corresponding path program 1 times [2024-11-11 21:08:25,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:25,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138767673] [2024-11-11 21:08:25,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:25,919 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-11 21:08:25,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:25,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138767673] [2024-11-11 21:08:25,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138767673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:25,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:25,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:25,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589878056] [2024-11-11 21:08:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:25,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:25,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:25,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:25,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:25,922 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-11 21:08:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:27,337 INFO L93 Difference]: Finished difference Result 12484 states and 19128 transitions. [2024-11-11 21:08:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:08:27,338 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-11 21:08:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:27,369 INFO L225 Difference]: With dead ends: 12484 [2024-11-11 21:08:27,369 INFO L226 Difference]: Without dead ends: 9269 [2024-11-11 21:08:27,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:08:27,377 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 1032 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:27,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 881 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 21:08:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9269 states. [2024-11-11 21:08:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9269 to 6224. [2024-11-11 21:08:27,657 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-11 21:08:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 9500 transitions. [2024-11-11 21:08:27,736 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 9500 transitions. Word has length 100 [2024-11-11 21:08:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:27,738 INFO L471 AbstractCegarLoop]: Abstraction has 6224 states and 9500 transitions. [2024-11-11 21:08:27,739 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-11 21:08:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 9500 transitions. [2024-11-11 21:08:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:27,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:27,746 INFO L218 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-11 21:08:27,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:08:27,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:27,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1853574784, now seen corresponding path program 1 times [2024-11-11 21:08:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142065446] [2024-11-11 21:08:27,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:27,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:27,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:08:27,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:27,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142065446] [2024-11-11 21:08:27,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142065446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:27,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:27,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550024910] [2024-11-11 21:08:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:27,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:27,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:27,910 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-11 21:08:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:29,928 INFO L93 Difference]: Finished difference Result 23898 states and 36876 transitions. [2024-11-11 21:08:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:08:29,929 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-11 21:08:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:30,009 INFO L225 Difference]: With dead ends: 23898 [2024-11-11 21:08:30,009 INFO L226 Difference]: Without dead ends: 17687 [2024-11-11 21:08:30,031 INFO L434 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-11 21:08:30,034 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 801 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:30,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1329 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:08:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17687 states. [2024-11-11 21:08:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17687 to 12037. [2024-11-11 21:08:30,829 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-11 21:08:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12037 states to 12037 states and 18620 transitions. [2024-11-11 21:08:30,860 INFO L78 Accepts]: Start accepts. Automaton has 12037 states and 18620 transitions. Word has length 100 [2024-11-11 21:08:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:30,860 INFO L471 AbstractCegarLoop]: Abstraction has 12037 states and 18620 transitions. [2024-11-11 21:08:30,860 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-11 21:08:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 12037 states and 18620 transitions. [2024-11-11 21:08:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:30,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:30,879 INFO L218 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-11 21:08:30,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:08:30,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1014541122, now seen corresponding path program 1 times [2024-11-11 21:08:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860004540] [2024-11-11 21:08:30,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:30,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:30,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:30,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:30,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:31,044 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-11 21:08:31,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:31,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860004540] [2024-11-11 21:08:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860004540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:31,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:31,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:31,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264376242] [2024-11-11 21:08:31,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:31,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:31,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:31,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:31,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:31,046 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-11 21:08:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:33,590 INFO L93 Difference]: Finished difference Result 45653 states and 71274 transitions. [2024-11-11 21:08:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:08:33,591 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-11 21:08:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:33,709 INFO L225 Difference]: With dead ends: 45653 [2024-11-11 21:08:33,709 INFO L226 Difference]: Without dead ends: 33629 [2024-11-11 21:08:33,752 INFO L434 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-11 21:08:33,754 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 893 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:33,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1333 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 21:08:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33629 states. [2024-11-11 21:08:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33629 to 23790. [2024-11-11 21:08:35,197 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-11 21:08:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23790 states to 23790 states and 37568 transitions. [2024-11-11 21:08:35,280 INFO L78 Accepts]: Start accepts. Automaton has 23790 states and 37568 transitions. Word has length 100 [2024-11-11 21:08:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:35,281 INFO L471 AbstractCegarLoop]: Abstraction has 23790 states and 37568 transitions. [2024-11-11 21:08:35,281 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-11 21:08:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 23790 states and 37568 transitions. [2024-11-11 21:08:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:35,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:35,297 INFO L218 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-11 21:08:35,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:08:35,297 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:35,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash -987475520, now seen corresponding path program 1 times [2024-11-11 21:08:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:35,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088503619] [2024-11-11 21:08:35,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:35,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:35,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:35,414 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-11 21:08:35,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:35,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088503619] [2024-11-11 21:08:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088503619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:35,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824929980] [2024-11-11 21:08:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:35,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:35,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:35,416 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-11 21:08:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:39,781 INFO L93 Difference]: Finished difference Result 88396 states and 140832 transitions. [2024-11-11 21:08:39,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:08:39,782 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-11 21:08:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:40,236 INFO L225 Difference]: With dead ends: 88396 [2024-11-11 21:08:40,237 INFO L226 Difference]: Without dead ends: 64619 [2024-11-11 21:08:40,309 INFO L434 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-11 21:08:40,312 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 853 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:40,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1333 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:08:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64619 states. [2024-11-11 21:08:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64619 to 47231. [2024-11-11 21:08:43,215 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-11 21:08:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47231 states to 47231 states and 76856 transitions. [2024-11-11 21:08:43,424 INFO L78 Accepts]: Start accepts. Automaton has 47231 states and 76856 transitions. Word has length 100 [2024-11-11 21:08:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:43,425 INFO L471 AbstractCegarLoop]: Abstraction has 47231 states and 76856 transitions. [2024-11-11 21:08:43,425 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-11 21:08:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 47231 states and 76856 transitions. [2024-11-11 21:08:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:43,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:43,462 INFO L218 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-11 21:08:43,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:08:43,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:43,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1230154878, now seen corresponding path program 1 times [2024-11-11 21:08:43,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:43,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143281543] [2024-11-11 21:08:43,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,614 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-11 21:08:43,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:43,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143281543] [2024-11-11 21:08:43,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143281543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:43,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:43,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:43,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863494478] [2024-11-11 21:08:43,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:43,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:43,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:43,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:43,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:43,616 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-11 21:08:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:51,473 INFO L93 Difference]: Finished difference Result 171515 states and 282006 transitions. [2024-11-11 21:08:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:08:51,474 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-11 21:08:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:52,548 INFO L225 Difference]: With dead ends: 171515 [2024-11-11 21:08:52,549 INFO L226 Difference]: Without dead ends: 124297 [2024-11-11 21:08:52,718 INFO L434 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-11 21:08:52,719 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 769 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:52,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1333 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 21:08:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124297 states. [2024-11-11 21:08:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124297 to 93984. [2024-11-11 21:08:58,113 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-11 21:08:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93984 states to 93984 states and 159676 transitions. [2024-11-11 21:08:58,467 INFO L78 Accepts]: Start accepts. Automaton has 93984 states and 159676 transitions. Word has length 100 [2024-11-11 21:08:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:58,467 INFO L471 AbstractCegarLoop]: Abstraction has 93984 states and 159676 transitions. [2024-11-11 21:08:58,467 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-11 21:08:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 93984 states and 159676 transitions. [2024-11-11 21:08:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:08:58,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:58,535 INFO L218 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-11 21:08:58,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:08:58,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:58,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1330707968, now seen corresponding path program 1 times [2024-11-11 21:08:58,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:58,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738462527] [2024-11-11 21:08:58,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:58,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:08:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:08:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:58,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:08:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:58,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:08:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:08:58,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738462527] [2024-11-11 21:08:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738462527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:58,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:58,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887739859] [2024-11-11 21:08:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:58,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:58,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:58,650 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)