./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bbfdf3f22061e77485b28b33d06a9820d2c4b7aa22afc378a1743c2d746b69df --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:24:59,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:24:59,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:24:59,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:24:59,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:24:59,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:24:59,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:24:59,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:24:59,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:24:59,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:24:59,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:24:59,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:24:59,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:24:59,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:24:59,706 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:24:59,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:24:59,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:24:59,707 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:24:59,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:24:59,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:24:59,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:24:59,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:24:59,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:24:59,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:24:59,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:24:59,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:24:59,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:24:59,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:24:59,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:24:59,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:24:59,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:24:59,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:24:59,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:24:59,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:24:59,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:24:59,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:24:59,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:24:59,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:24:59,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:24:59,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:24:59,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:24:59,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:24:59,716 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 -> bbfdf3f22061e77485b28b33d06a9820d2c4b7aa22afc378a1743c2d746b69df [2024-10-14 03:24:59,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:24:59,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:24:59,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:24:59,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:24:59,984 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:24:59,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c [2024-10-14 03:25:01,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:25:01,691 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:25:01,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c [2024-10-14 03:25:01,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7730ce22/4e7101c0848f456b845d70b95fece027/FLAGc9836ab3b [2024-10-14 03:25:01,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7730ce22/4e7101c0848f456b845d70b95fece027 [2024-10-14 03:25:01,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:25:01,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:25:01,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:25:01,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:25:01,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:25:01,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:01,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d9801a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01, skipping insertion in model container [2024-10-14 03:25:01,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:01,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:25:01,936 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c[706,719] [2024-10-14 03:25:02,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:25:02,036 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:25:02,051 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c[706,719] [2024-10-14 03:25:02,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:25:02,136 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:25:02,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02 WrapperNode [2024-10-14 03:25:02,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:25:02,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:25:02,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:25:02,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:25:02,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,195 INFO L138 Inliner]: procedures = 40, calls = 48, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 505 [2024-10-14 03:25:02,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:25:02,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:25:02,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:25:02,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:25:02,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,231 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:25:02,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:25:02,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:25:02,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:25:02,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:25:02,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (1/1) ... [2024-10-14 03:25:02,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:25:02,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:02,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:25:02,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:25:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:25:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:25:02,351 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:25:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:25:02,351 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:25:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:25:02,352 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:25:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:25:02,352 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:25:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:25:02,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:25:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:25:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:25:02,352 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:25:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:25:02,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:25:02,464 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:25:02,468 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:25:03,057 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-14 03:25:03,057 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:25:03,113 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:25:03,113 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 03:25:03,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:25:03 BoogieIcfgContainer [2024-10-14 03:25:03,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:25:03,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:25:03,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:25:03,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:25:03,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:25:01" (1/3) ... [2024-10-14 03:25:03,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c46411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:25:03, skipping insertion in model container [2024-10-14 03:25:03,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:02" (2/3) ... [2024-10-14 03:25:03,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c46411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:25:03, skipping insertion in model container [2024-10-14 03:25:03,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:25:03" (3/3) ... [2024-10-14 03:25:03,123 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2024-10-14 03:25:03,142 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:25:03,142 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:25:03,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:25:03,219 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;@638dee25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:25:03,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:25:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 178 states have (on average 1.7134831460674158) internal successors, (305), 180 states have internal predecessors, (305), 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-10-14 03:25:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:03,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:03,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:03,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:03,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash -148933588, now seen corresponding path program 1 times [2024-10-14 03:25:03,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:03,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658550885] [2024-10-14 03:25:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:03,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:03,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:03,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658550885] [2024-10-14 03:25:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658550885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:25:03,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552453848] [2024-10-14 03:25:03,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:03,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:25:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:03,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:25:03,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:25:03,860 INFO L87 Difference]: Start difference. First operand has 205 states, 178 states have (on average 1.7134831460674158) internal successors, (305), 180 states have internal predecessors, (305), 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 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:05,042 INFO L93 Difference]: Finished difference Result 472 states and 796 transitions. [2024-10-14 03:25:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:25:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-14 03:25:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:05,061 INFO L225 Difference]: With dead ends: 472 [2024-10-14 03:25:05,062 INFO L226 Difference]: Without dead ends: 271 [2024-10-14 03:25:05,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:25:05,073 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 536 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:05,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 365 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:25:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-14 03:25:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 203. [2024-10-14 03:25:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 178 states have internal predecessors, (281), 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-10-14 03:25:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 319 transitions. [2024-10-14 03:25:05,156 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 319 transitions. Word has length 103 [2024-10-14 03:25:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:05,157 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 319 transitions. [2024-10-14 03:25:05,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 319 transitions. [2024-10-14 03:25:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:05,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:05,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:05,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:25:05,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:05,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash 907797614, now seen corresponding path program 1 times [2024-10-14 03:25:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586786529] [2024-10-14 03:25:05,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:05,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586786529] [2024-10-14 03:25:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586786529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:05,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:05,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945583970] [2024-10-14 03:25:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:05,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:05,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:05,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:05,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:05,477 INFO L87 Difference]: Start difference. First operand 203 states and 319 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:07,058 INFO L93 Difference]: Finished difference Result 727 states and 1178 transitions. [2024-10-14 03:25:07,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:25:07,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:07,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:07,067 INFO L225 Difference]: With dead ends: 727 [2024-10-14 03:25:07,067 INFO L226 Difference]: Without dead ends: 536 [2024-10-14 03:25:07,068 INFO L431 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-10-14 03:25:07,069 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 796 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:07,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 684 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:25:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-14 03:25:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 401. [2024-10-14 03:25:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 354 states have (on average 1.5932203389830508) internal successors, (564), 356 states have internal predecessors, (564), 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-10-14 03:25:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 633 transitions. [2024-10-14 03:25:07,139 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 633 transitions. Word has length 103 [2024-10-14 03:25:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:07,140 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 633 transitions. [2024-10-14 03:25:07,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 633 transitions. [2024-10-14 03:25:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:07,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:07,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:07,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:25:07,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:07,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1192356975, now seen corresponding path program 1 times [2024-10-14 03:25:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933955521] [2024-10-14 03:25:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:07,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933955521] [2024-10-14 03:25:07,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933955521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:07,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:07,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:07,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581767844] [2024-10-14 03:25:07,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:07,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:07,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:07,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:07,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:07,415 INFO L87 Difference]: Start difference. First operand 401 states and 633 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:09,775 INFO L93 Difference]: Finished difference Result 1279 states and 2050 transitions. [2024-10-14 03:25:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:09,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:09,780 INFO L225 Difference]: With dead ends: 1279 [2024-10-14 03:25:09,781 INFO L226 Difference]: Without dead ends: 890 [2024-10-14 03:25:09,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:25:09,783 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 862 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:09,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1156 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 03:25:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-14 03:25:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 585. [2024-10-14 03:25:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 517 states have (on average 1.5841392649903288) internal successors, (819), 520 states have internal predecessors, (819), 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-10-14 03:25:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 918 transitions. [2024-10-14 03:25:09,841 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 918 transitions. Word has length 103 [2024-10-14 03:25:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:09,843 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 918 transitions. [2024-10-14 03:25:09,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 918 transitions. [2024-10-14 03:25:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:09,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:09,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:09,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:25:09,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:09,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:09,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2107916623, now seen corresponding path program 1 times [2024-10-14 03:25:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:09,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818947036] [2024-10-14 03:25:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:09,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:10,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:10,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818947036] [2024-10-14 03:25:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818947036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:10,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:10,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912937204] [2024-10-14 03:25:10,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:10,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:10,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:10,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:10,065 INFO L87 Difference]: Start difference. First operand 585 states and 918 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:12,304 INFO L93 Difference]: Finished difference Result 1969 states and 3145 transitions. [2024-10-14 03:25:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:12,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:12,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:12,315 INFO L225 Difference]: With dead ends: 1969 [2024-10-14 03:25:12,316 INFO L226 Difference]: Without dead ends: 1396 [2024-10-14 03:25:12,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:25:12,321 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 866 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:12,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1154 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 03:25:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-10-14 03:25:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 954. [2024-10-14 03:25:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 844 states have (on average 1.5758293838862558) internal successors, (1330), 849 states have internal predecessors, (1330), 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-10-14 03:25:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1493 transitions. [2024-10-14 03:25:12,408 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1493 transitions. Word has length 103 [2024-10-14 03:25:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:12,409 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1493 transitions. [2024-10-14 03:25:12,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:12,410 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1493 transitions. [2024-10-14 03:25:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:12,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:12,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:12,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:25:12,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:12,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1521640401, now seen corresponding path program 1 times [2024-10-14 03:25:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:12,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435184425] [2024-10-14 03:25:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435184425] [2024-10-14 03:25:12,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435184425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:12,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:12,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027129489] [2024-10-14 03:25:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:12,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:12,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:12,638 INFO L87 Difference]: Start difference. First operand 954 states and 1493 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:13,545 INFO L93 Difference]: Finished difference Result 2242 states and 3572 transitions. [2024-10-14 03:25:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:13,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:13,554 INFO L225 Difference]: With dead ends: 2242 [2024-10-14 03:25:13,554 INFO L226 Difference]: Without dead ends: 1300 [2024-10-14 03:25:13,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:13,559 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 681 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:13,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 485 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:25:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-10-14 03:25:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 954. [2024-10-14 03:25:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 844 states have (on average 1.569905213270142) internal successors, (1325), 849 states have internal predecessors, (1325), 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-10-14 03:25:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1488 transitions. [2024-10-14 03:25:13,632 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1488 transitions. Word has length 103 [2024-10-14 03:25:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:13,632 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1488 transitions. [2024-10-14 03:25:13,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1488 transitions. [2024-10-14 03:25:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:13,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:13,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:13,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:25:13,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:13,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash -896844077, now seen corresponding path program 1 times [2024-10-14 03:25:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:13,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638161919] [2024-10-14 03:25:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:13,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:13,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638161919] [2024-10-14 03:25:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638161919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:13,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:13,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078684380] [2024-10-14 03:25:13,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:13,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:13,804 INFO L87 Difference]: Start difference. First operand 954 states and 1488 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:14,658 INFO L93 Difference]: Finished difference Result 2236 states and 3545 transitions. [2024-10-14 03:25:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:14,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:14,667 INFO L225 Difference]: With dead ends: 2236 [2024-10-14 03:25:14,667 INFO L226 Difference]: Without dead ends: 1294 [2024-10-14 03:25:14,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:14,672 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 679 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:14,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 485 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-10-14 03:25:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 954. [2024-10-14 03:25:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 844 states have (on average 1.5639810426540284) internal successors, (1320), 849 states have internal predecessors, (1320), 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-10-14 03:25:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1483 transitions. [2024-10-14 03:25:14,771 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1483 transitions. Word has length 103 [2024-10-14 03:25:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:14,772 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1483 transitions. [2024-10-14 03:25:14,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1483 transitions. [2024-10-14 03:25:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:14,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:14,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:14,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:25:14,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:14,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1518992273, now seen corresponding path program 1 times [2024-10-14 03:25:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022289621] [2024-10-14 03:25:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:14,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:14,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:14,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022289621] [2024-10-14 03:25:14,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022289621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:14,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:14,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369043886] [2024-10-14 03:25:14,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:14,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:14,967 INFO L87 Difference]: Start difference. First operand 954 states and 1483 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:16,812 INFO L93 Difference]: Finished difference Result 3281 states and 5168 transitions. [2024-10-14 03:25:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:16,827 INFO L225 Difference]: With dead ends: 3281 [2024-10-14 03:25:16,829 INFO L226 Difference]: Without dead ends: 2339 [2024-10-14 03:25:16,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:25:16,833 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 848 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:16,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1154 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:25:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2024-10-14 03:25:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 1708. [2024-10-14 03:25:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1514 states have (on average 1.5561426684280053) internal successors, (2356), 1523 states have internal predecessors, (2356), 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-10-14 03:25:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2653 transitions. [2024-10-14 03:25:16,969 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2653 transitions. Word has length 103 [2024-10-14 03:25:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:16,972 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 2653 transitions. [2024-10-14 03:25:16,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2653 transitions. [2024-10-14 03:25:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:16,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:16,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:16,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:25:16,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:16,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1451118829, now seen corresponding path program 1 times [2024-10-14 03:25:16,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:16,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361874028] [2024-10-14 03:25:16,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:17,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:17,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361874028] [2024-10-14 03:25:17,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361874028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:17,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:17,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200310252] [2024-10-14 03:25:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:17,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:17,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:17,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:17,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:17,141 INFO L87 Difference]: Start difference. First operand 1708 states and 2653 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:19,305 INFO L93 Difference]: Finished difference Result 6501 states and 10230 transitions. [2024-10-14 03:25:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:19,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:19,329 INFO L225 Difference]: With dead ends: 6501 [2024-10-14 03:25:19,329 INFO L226 Difference]: Without dead ends: 4805 [2024-10-14 03:25:19,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:19,336 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 894 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:19,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1135 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:25:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2024-10-14 03:25:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 3193. [2024-10-14 03:25:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 2839 states have (on average 1.5533638605142657) internal successors, (4410), 2856 states have internal predecessors, (4410), 235 states have call successors, (235), 102 states have call predecessors, (235), 118 states have return successors, (332), 250 states have call predecessors, (332), 235 states have call successors, (332) [2024-10-14 03:25:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4977 transitions. [2024-10-14 03:25:19,613 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4977 transitions. Word has length 103 [2024-10-14 03:25:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:19,613 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4977 transitions. [2024-10-14 03:25:19,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4977 transitions. [2024-10-14 03:25:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:19,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:19,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:19,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:25:19,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:19,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 115639121, now seen corresponding path program 1 times [2024-10-14 03:25:19,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:19,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058790609] [2024-10-14 03:25:19,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:19,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:19,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:19,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058790609] [2024-10-14 03:25:19,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058790609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:19,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:19,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:19,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661976448] [2024-10-14 03:25:19,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:19,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:19,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:19,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:19,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:19,769 INFO L87 Difference]: Start difference. First operand 3193 states and 4977 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:20,841 INFO L93 Difference]: Finished difference Result 7336 states and 11598 transitions. [2024-10-14 03:25:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:20,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:20,862 INFO L225 Difference]: With dead ends: 7336 [2024-10-14 03:25:20,862 INFO L226 Difference]: Without dead ends: 4155 [2024-10-14 03:25:20,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:20,874 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 591 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:20,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 579 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:25:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2024-10-14 03:25:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3193. [2024-10-14 03:25:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 2839 states have (on average 1.5473758365621697) internal successors, (4393), 2856 states have internal predecessors, (4393), 235 states have call successors, (235), 102 states have call predecessors, (235), 118 states have return successors, (332), 250 states have call predecessors, (332), 235 states have call successors, (332) [2024-10-14 03:25:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4960 transitions. [2024-10-14 03:25:21,120 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4960 transitions. Word has length 103 [2024-10-14 03:25:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:21,120 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4960 transitions. [2024-10-14 03:25:21,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4960 transitions. [2024-10-14 03:25:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:21,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:21,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:21,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:25:21,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:21,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash -942198957, now seen corresponding path program 1 times [2024-10-14 03:25:21,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:21,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488844075] [2024-10-14 03:25:21,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:21,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:21,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488844075] [2024-10-14 03:25:21,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488844075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:21,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:21,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161953783] [2024-10-14 03:25:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:21,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:21,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:21,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:21,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:21,286 INFO L87 Difference]: Start difference. First operand 3193 states and 4960 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:23,548 INFO L93 Difference]: Finished difference Result 11902 states and 18696 transitions. [2024-10-14 03:25:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:23,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:23,601 INFO L225 Difference]: With dead ends: 11902 [2024-10-14 03:25:23,602 INFO L226 Difference]: Without dead ends: 8721 [2024-10-14 03:25:23,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:23,616 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 958 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:23,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1135 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:25:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2024-10-14 03:25:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 6187. [2024-10-14 03:25:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6187 states, 5521 states have (on average 1.5441043289259193) internal successors, (8525), 5554 states have internal predecessors, (8525), 435 states have call successors, (435), 198 states have call predecessors, (435), 230 states have return successors, (710), 466 states have call predecessors, (710), 435 states have call successors, (710) [2024-10-14 03:25:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 9670 transitions. [2024-10-14 03:25:24,135 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 9670 transitions. Word has length 103 [2024-10-14 03:25:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:24,135 INFO L471 AbstractCegarLoop]: Abstraction has 6187 states and 9670 transitions. [2024-10-14 03:25:24,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 9670 transitions. [2024-10-14 03:25:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:24,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:24,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:24,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:25:24,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:24,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2084701423, now seen corresponding path program 1 times [2024-10-14 03:25:24,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:24,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127717624] [2024-10-14 03:25:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:24,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:24,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:24,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:24,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:24,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127717624] [2024-10-14 03:25:24,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127717624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:24,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:24,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:24,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112622353] [2024-10-14 03:25:24,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:24,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:24,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:24,353 INFO L87 Difference]: Start difference. First operand 6187 states and 9670 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:27,094 INFO L93 Difference]: Finished difference Result 22718 states and 35888 transitions. [2024-10-14 03:25:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:27,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:27,162 INFO L225 Difference]: With dead ends: 22718 [2024-10-14 03:25:27,162 INFO L226 Difference]: Without dead ends: 16543 [2024-10-14 03:25:27,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:27,186 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 864 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:27,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1135 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:25:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16543 states. [2024-10-14 03:25:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16543 to 12172. [2024-10-14 03:25:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12172 states, 10898 states have (on average 1.5429436593870436) internal successors, (16815), 10963 states have internal predecessors, (16815), 819 states have call successors, (819), 390 states have call predecessors, (819), 454 states have return successors, (1612), 882 states have call predecessors, (1612), 819 states have call successors, (1612) [2024-10-14 03:25:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12172 states to 12172 states and 19246 transitions. [2024-10-14 03:25:28,307 INFO L78 Accepts]: Start accepts. Automaton has 12172 states and 19246 transitions. Word has length 103 [2024-10-14 03:25:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:28,307 INFO L471 AbstractCegarLoop]: Abstraction has 12172 states and 19246 transitions. [2024-10-14 03:25:28,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 12172 states and 19246 transitions. [2024-10-14 03:25:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:28,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:28,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:25:28,323 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1844461677, now seen corresponding path program 1 times [2024-10-14 03:25:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595185824] [2024-10-14 03:25:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:28,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:28,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:28,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:28,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:28,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595185824] [2024-10-14 03:25:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595185824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794193560] [2024-10-14 03:25:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:28,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:28,476 INFO L87 Difference]: Start difference. First operand 12172 states and 19246 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:32,233 INFO L93 Difference]: Finished difference Result 43035 states and 68802 transitions. [2024-10-14 03:25:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:32,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:32,357 INFO L225 Difference]: With dead ends: 43035 [2024-10-14 03:25:32,357 INFO L226 Difference]: Without dead ends: 30875 [2024-10-14 03:25:32,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:32,393 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 838 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:32,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1135 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:25:32,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30875 states. [2024-10-14 03:25:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30875 to 24206. [2024-10-14 03:25:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24206 states, 21748 states have (on average 1.5443718962663233) internal successors, (33587), 21877 states have internal predecessors, (33587), 1555 states have call successors, (1555), 774 states have call predecessors, (1555), 902 states have return successors, (3870), 1682 states have call predecessors, (3870), 1555 states have call successors, (3870) [2024-10-14 03:25:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24206 states to 24206 states and 39012 transitions. [2024-10-14 03:25:33,903 INFO L78 Accepts]: Start accepts. Automaton has 24206 states and 39012 transitions. Word has length 103 [2024-10-14 03:25:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:33,904 INFO L471 AbstractCegarLoop]: Abstraction has 24206 states and 39012 transitions. [2024-10-14 03:25:33,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 24206 states and 39012 transitions. [2024-10-14 03:25:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:33,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:33,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:33,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:25:33,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:33,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1817396075, now seen corresponding path program 1 times [2024-10-14 03:25:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:33,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918407921] [2024-10-14 03:25:33,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:33,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:34,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:34,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918407921] [2024-10-14 03:25:34,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918407921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:34,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:34,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:34,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365415489] [2024-10-14 03:25:34,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:34,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:34,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:34,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:34,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:34,110 INFO L87 Difference]: Start difference. First operand 24206 states and 39012 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:37,068 INFO L93 Difference]: Finished difference Result 53303 states and 86366 transitions. [2024-10-14 03:25:37,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:37,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:37,209 INFO L225 Difference]: With dead ends: 53303 [2024-10-14 03:25:37,209 INFO L226 Difference]: Without dead ends: 29110 [2024-10-14 03:25:37,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:25:37,288 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 267 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:37,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 652 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:25:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29110 states. [2024-10-14 03:25:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29110 to 24208. [2024-10-14 03:25:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24208 states, 21750 states have (on average 1.5384367816091955) internal successors, (33461), 21879 states have internal predecessors, (33461), 1555 states have call successors, (1555), 774 states have call predecessors, (1555), 902 states have return successors, (3870), 1682 states have call predecessors, (3870), 1555 states have call successors, (3870) [2024-10-14 03:25:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24208 states to 24208 states and 38886 transitions. [2024-10-14 03:25:39,101 INFO L78 Accepts]: Start accepts. Automaton has 24208 states and 38886 transitions. Word has length 103 [2024-10-14 03:25:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:39,102 INFO L471 AbstractCegarLoop]: Abstraction has 24208 states and 38886 transitions. [2024-10-14 03:25:39,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 24208 states and 38886 transitions. [2024-10-14 03:25:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:39,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:39,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:39,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:25:39,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:39,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1984945047, now seen corresponding path program 1 times [2024-10-14 03:25:39,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:39,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373443200] [2024-10-14 03:25:39,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:39,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:39,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:39,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:39,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:39,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:39,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:39,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:39,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373443200] [2024-10-14 03:25:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373443200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:39,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679557985] [2024-10-14 03:25:39,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:39,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:39,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:39,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:39,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:39,265 INFO L87 Difference]: Start difference. First operand 24208 states and 38886 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:42,237 INFO L93 Difference]: Finished difference Result 53565 states and 86501 transitions. [2024-10-14 03:25:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:25:42,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:42,347 INFO L225 Difference]: With dead ends: 53565 [2024-10-14 03:25:42,347 INFO L226 Difference]: Without dead ends: 29370 [2024-10-14 03:25:42,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:42,400 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 278 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:42,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 652 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29370 states. [2024-10-14 03:25:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29370 to 24466. [2024-10-14 03:25:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24466 states, 22008 states have (on average 1.5321246819338423) internal successors, (33719), 22137 states have internal predecessors, (33719), 1555 states have call successors, (1555), 774 states have call predecessors, (1555), 902 states have return successors, (3870), 1682 states have call predecessors, (3870), 1555 states have call successors, (3870) [2024-10-14 03:25:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24466 states to 24466 states and 39144 transitions. [2024-10-14 03:25:43,824 INFO L78 Accepts]: Start accepts. Automaton has 24466 states and 39144 transitions. Word has length 103 [2024-10-14 03:25:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:43,824 INFO L471 AbstractCegarLoop]: Abstraction has 24466 states and 39144 transitions. [2024-10-14 03:25:43,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 24466 states and 39144 transitions. [2024-10-14 03:25:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:25:43,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:43,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:43,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:25:43,854 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:43,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1930552149, now seen corresponding path program 1 times [2024-10-14 03:25:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856780032] [2024-10-14 03:25:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:43,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:43,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:25:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:43,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:25:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:44,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:25:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:25:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:44,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856780032] [2024-10-14 03:25:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856780032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:44,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:44,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:44,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000276855] [2024-10-14 03:25:44,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:44,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:44,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:44,027 INFO L87 Difference]: Start difference. First operand 24466 states and 39144 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:25:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:52,924 INFO L93 Difference]: Finished difference Result 136801 states and 223349 transitions. [2024-10-14 03:25:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:25:52,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-14 03:25:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:53,541 INFO L225 Difference]: With dead ends: 136801 [2024-10-14 03:25:53,542 INFO L226 Difference]: Without dead ends: 112348 [2024-10-14 03:25:53,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:53,668 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 2091 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2107 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:53,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2107 Valid, 1064 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:25:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112348 states. [2024-10-14 03:26:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112348 to 93299. [2024-10-14 03:26:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93299 states, 83999 states have (on average 1.5267443660043571) internal successors, (128245), 84512 states have internal predecessors, (128245), 5691 states have call successors, (5691), 3096 states have call predecessors, (5691), 3608 states have return successors, (16707), 5818 states have call predecessors, (16707), 5691 states have call successors, (16707) [2024-10-14 03:26:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93299 states to 93299 states and 150643 transitions. [2024-10-14 03:26:00,660 INFO L78 Accepts]: Start accepts. Automaton has 93299 states and 150643 transitions. Word has length 103 [2024-10-14 03:26:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:00,660 INFO L471 AbstractCegarLoop]: Abstraction has 93299 states and 150643 transitions. [2024-10-14 03:26:00,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:26:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 93299 states and 150643 transitions. [2024-10-14 03:26:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:26:00,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:00,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:00,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:26:00,689 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash -544689228, now seen corresponding path program 1 times [2024-10-14 03:26:00,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:00,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926683651] [2024-10-14 03:26:00,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:26:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:26:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:26:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:26:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:26:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:26:00,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:00,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926683651] [2024-10-14 03:26:00,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926683651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:00,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:00,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:26:00,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416457792] [2024-10-14 03:26:00,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:00,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:26:00,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:00,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:26:00,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:26:00,812 INFO L87 Difference]: Start difference. First operand 93299 states and 150643 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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)