./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/hardness-nfm22/hardness_operatoramount_amount100_file-61.i -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 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:54:06,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:54:06,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:54:06,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:54:06,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:54:06,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:54:06,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:54:06,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:54:06,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:54:06,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:54:06,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:54:06,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:54:06,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:54:06,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:54:06,255 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:54:06,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:54:06,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:54:06,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:54:06,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:54:06,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:54:06,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:54:06,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:54:06,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:54:06,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:54:06,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:54:06,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:54:06,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:54:06,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:54:06,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:54:06,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:54:06,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:54:06,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:54:06,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:54:06,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:54:06,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:54:06,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:54:06,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:54:06,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:54:06,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:54:06,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:54:06,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:54:06,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:54:06,264 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 -> 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 [2024-10-13 04:54:06,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:54:06,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:54:06,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:54:06,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:54:06,550 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:54:06,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-10-13 04:54:08,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:54:08,286 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:54:08,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-10-13 04:54:08,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eabd49c32/2ebce96b7d7c45bebc4ddfeac66bc00b/FLAG2483341e6 [2024-10-13 04:54:08,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eabd49c32/2ebce96b7d7c45bebc4ddfeac66bc00b [2024-10-13 04:54:08,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:54:08,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:54:08,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:54:08,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:54:08,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:54:08,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d40be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08, skipping insertion in model container [2024-10-13 04:54:08,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:54:08,560 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/hardness-nfm22/hardness_operatoramount_amount100_file-61.i[916,929] [2024-10-13 04:54:08,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:54:08,669 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:54:08,681 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/hardness-nfm22/hardness_operatoramount_amount100_file-61.i[916,929] [2024-10-13 04:54:08,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:54:08,766 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:54:08,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08 WrapperNode [2024-10-13 04:54:08,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:54:08,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:54:08,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:54:08,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:54:08,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,849 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2024-10-13 04:54:08,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:54:08,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:54:08,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:54:08,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:54:08,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,894 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-13 04:54:08,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:54:08,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:54:08,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:54:08,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:54:08,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (1/1) ... [2024-10-13 04:54:08,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:54:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:54:08,968 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-13 04:54:08,971 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-13 04:54:09,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:54:09,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:54:09,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:54:09,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:54:09,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:54:09,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:54:09,116 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:54:09,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:54:09,611 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-13 04:54:09,612 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:54:09,655 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:54:09,656 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:54:09,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:54:09 BoogieIcfgContainer [2024-10-13 04:54:09,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:54:09,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:54:09,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:54:09,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:54:09,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:54:08" (1/3) ... [2024-10-13 04:54:09,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0745e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:54:09, skipping insertion in model container [2024-10-13 04:54:09,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:08" (2/3) ... [2024-10-13 04:54:09,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0745e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:54:09, skipping insertion in model container [2024-10-13 04:54:09,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:54:09" (3/3) ... [2024-10-13 04:54:09,667 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-61.i [2024-10-13 04:54:09,684 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:54:09,685 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:54:09,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:54:09,797 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;@184917eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:54:09,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:54:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 72 states have internal predecessors, (108), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:54:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 04:54:09,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:09,823 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:09,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:09,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:09,829 INFO L85 PathProgramCache]: Analyzing trace with hash 892643129, now seen corresponding path program 1 times [2024-10-13 04:54:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819459348] [2024-10-13 04:54:09,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:54:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:54:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:54:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:54:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:54:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:54:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:54:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:54:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:54:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:54:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:54:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:54:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:54:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:54:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:54:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:54:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:54:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:54:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:54:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:54:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:54:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:54:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:54:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:54:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 04:54:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:54:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 04:54:10,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:54:10,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819459348] [2024-10-13 04:54:10,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819459348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:54:10,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:54:10,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:54:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130030346] [2024-10-13 04:54:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:54:10,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:54:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:54:10,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:54:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:54:10,423 INFO L87 Difference]: Start difference. First operand has 100 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 72 states have internal predecessors, (108), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 04:54:10,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:54:10,488 INFO L93 Difference]: Finished difference Result 197 states and 344 transitions. [2024-10-13 04:54:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:54:10,492 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-10-13 04:54:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:54:10,501 INFO L225 Difference]: With dead ends: 197 [2024-10-13 04:54:10,501 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 04:54:10,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:54:10,512 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:54:10,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:54:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 04:54:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-13 04:54:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 70 states have internal predecessors, (103), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:54:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2024-10-13 04:54:10,570 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 171 [2024-10-13 04:54:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:54:10,573 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2024-10-13 04:54:10,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 04:54:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2024-10-13 04:54:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 04:54:10,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:10,580 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:10,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:54:10,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:10,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1828401791, now seen corresponding path program 1 times [2024-10-13 04:54:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688703578] [2024-10-13 04:54:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:10,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:54:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:54:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:54:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:54:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:54:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:54:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:54:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:54:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:54:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:54:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:54:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:54:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:54:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:54:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:54:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:54:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:54:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:54:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:54:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:54:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:54:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:54:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:54:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:54:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 04:54:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:54:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 04:54:16,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:54:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688703578] [2024-10-13 04:54:16,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688703578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:54:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:54:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 04:54:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838060524] [2024-10-13 04:54:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:54:16,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 04:54:16,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:54:16,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 04:54:16,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:54:16,426 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-13 04:54:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:54:18,283 INFO L93 Difference]: Finished difference Result 483 states and 762 transitions. [2024-10-13 04:54:18,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 04:54:18,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 171 [2024-10-13 04:54:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:54:18,292 INFO L225 Difference]: With dead ends: 483 [2024-10-13 04:54:18,295 INFO L226 Difference]: Without dead ends: 386 [2024-10-13 04:54:18,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-13 04:54:18,298 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 855 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:54:18,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 616 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 04:54:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-13 04:54:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 236. [2024-10-13 04:54:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 04:54:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 377 transitions. [2024-10-13 04:54:18,336 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 377 transitions. Word has length 171 [2024-10-13 04:54:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:54:18,336 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 377 transitions. [2024-10-13 04:54:18,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-13 04:54:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 377 transitions. [2024-10-13 04:54:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 04:54:18,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:18,340 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:18,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:54:18,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:18,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1186701827, now seen corresponding path program 1 times [2024-10-13 04:54:18,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:18,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857678613] [2024-10-13 04:54:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:18,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:54:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:54:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:54:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:54:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:54:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:54:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:54:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:54:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:54:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:54:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:54:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:54:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:54:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:54:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:54:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:54:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:54:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:54:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:54:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:54:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:54:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:54:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:54:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:54:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 04:54:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:54:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 04:54:18,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:54:18,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857678613] [2024-10-13 04:54:18,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857678613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:54:18,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:54:18,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:54:18,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917043849] [2024-10-13 04:54:18,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:54:18,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:54:18,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:54:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:54:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:54:18,661 INFO L87 Difference]: Start difference. First operand 236 states and 377 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:54:18,743 INFO L93 Difference]: Finished difference Result 374 states and 589 transitions. [2024-10-13 04:54:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:54:18,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-13 04:54:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:54:18,748 INFO L225 Difference]: With dead ends: 374 [2024-10-13 04:54:18,748 INFO L226 Difference]: Without dead ends: 238 [2024-10-13 04:54:18,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:54:18,752 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 90 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:54:18,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 175 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:54:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-13 04:54:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-13 04:54:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 181 states have (on average 1.4640883977900552) internal successors, (265), 181 states have internal predecessors, (265), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 04:54:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 369 transitions. [2024-10-13 04:54:18,790 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 369 transitions. Word has length 171 [2024-10-13 04:54:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:54:18,791 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 369 transitions. [2024-10-13 04:54:18,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 369 transitions. [2024-10-13 04:54:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 04:54:18,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:18,794 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:18,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:54:18,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:18,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash 37638904, now seen corresponding path program 1 times [2024-10-13 04:54:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978994060] [2024-10-13 04:54:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:54:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:54:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:54:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:54:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:54:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:54:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:54:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:54:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:54:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:54:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:54:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:54:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:54:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:54:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:54:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:54:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:54:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:54:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:54:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:54:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:54:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:54:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:54:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:54:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 04:54:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:54:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 04:54:19,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:54:19,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978994060] [2024-10-13 04:54:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978994060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:54:19,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:54:19,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:54:19,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910506963] [2024-10-13 04:54:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:54:19,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:54:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:54:19,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:54:19,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:54:19,177 INFO L87 Difference]: Start difference. First operand 238 states and 369 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:54:19,392 INFO L93 Difference]: Finished difference Result 414 states and 645 transitions. [2024-10-13 04:54:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:54:19,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-13 04:54:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:54:19,396 INFO L225 Difference]: With dead ends: 414 [2024-10-13 04:54:19,397 INFO L226 Difference]: Without dead ends: 313 [2024-10-13 04:54:19,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:54:19,398 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 257 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:54:19,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 552 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:54:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-13 04:54:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 239. [2024-10-13 04:54:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 182 states have (on average 1.4615384615384615) internal successors, (266), 182 states have internal predecessors, (266), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 04:54:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 370 transitions. [2024-10-13 04:54:19,417 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 370 transitions. Word has length 172 [2024-10-13 04:54:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:54:19,417 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 370 transitions. [2024-10-13 04:54:19,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 370 transitions. [2024-10-13 04:54:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 04:54:19,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:19,422 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:19,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:54:19,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:19,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1767799430, now seen corresponding path program 1 times [2024-10-13 04:54:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:19,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131661711] [2024-10-13 04:54:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:54:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:54:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:54:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:54:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:54:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:54:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:54:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:54:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:54:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:54:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:54:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:54:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:54:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:54:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:54:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:54:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:54:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:54:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:54:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:54:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:54:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:54:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:54:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:54:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 04:54:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:54:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 04:54:20,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:54:20,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131661711] [2024-10-13 04:54:20,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131661711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:54:20,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:54:20,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:54:20,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861538437] [2024-10-13 04:54:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:54:20,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:54:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:54:20,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:54:20,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:54:20,610 INFO L87 Difference]: Start difference. First operand 239 states and 370 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 04:54:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:54:21,349 INFO L93 Difference]: Finished difference Result 513 states and 790 transitions. [2024-10-13 04:54:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:54:21,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-10-13 04:54:21,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:54:21,355 INFO L225 Difference]: With dead ends: 513 [2024-10-13 04:54:21,355 INFO L226 Difference]: Without dead ends: 412 [2024-10-13 04:54:21,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-13 04:54:21,358 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 620 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:54:21,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 545 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:54:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-13 04:54:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 255. [2024-10-13 04:54:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 198 states have (on average 1.47979797979798) internal successors, (293), 198 states have internal predecessors, (293), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 04:54:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 397 transitions. [2024-10-13 04:54:21,397 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 397 transitions. Word has length 172 [2024-10-13 04:54:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:54:21,399 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 397 transitions. [2024-10-13 04:54:21,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 04:54:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 397 transitions. [2024-10-13 04:54:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 04:54:21,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:21,402 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:21,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:54:21,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:21,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1111650613, now seen corresponding path program 1 times [2024-10-13 04:54:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:21,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945792295] [2024-10-13 04:54:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:54:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:54:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:54:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:54:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:54:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:54:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:54:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:54:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:54:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:54:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:54:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:54:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:54:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:54:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:54:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:54:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:54:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:54:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:54:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:54:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:54:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:54:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:54:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:54:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 04:54:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:54:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 04:54:23,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:54:23,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945792295] [2024-10-13 04:54:23,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945792295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:54:23,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:54:23,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:54:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100895872] [2024-10-13 04:54:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:54:23,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:54:23,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:54:23,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:54:23,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:54:23,131 INFO L87 Difference]: Start difference. First operand 255 states and 397 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:54:23,618 INFO L93 Difference]: Finished difference Result 429 states and 661 transitions. [2024-10-13 04:54:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:54:23,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-13 04:54:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:54:23,622 INFO L225 Difference]: With dead ends: 429 [2024-10-13 04:54:23,624 INFO L226 Difference]: Without dead ends: 319 [2024-10-13 04:54:23,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:54:23,625 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 152 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:54:23,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 396 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:54:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-13 04:54:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 273. [2024-10-13 04:54:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 216 states have (on average 1.4768518518518519) internal successors, (319), 216 states have internal predecessors, (319), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 04:54:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 423 transitions. [2024-10-13 04:54:23,655 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 423 transitions. Word has length 172 [2024-10-13 04:54:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:54:23,656 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 423 transitions. [2024-10-13 04:54:23,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 423 transitions. [2024-10-13 04:54:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 04:54:23,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:23,658 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:54:23,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash -279367905, now seen corresponding path program 1 times [2024-10-13 04:54:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168504799] [2024-10-13 04:54:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:54:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:54:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:54:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:54:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:54:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:54:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:54:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:54:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:54:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:54:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:54:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:54:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:54:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:54:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:54:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:54:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:54:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:54:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:54:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:54:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:54:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:54:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:54:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:54:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 04:54:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:54:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 04:54:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:54:25,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168504799] [2024-10-13 04:54:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168504799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:54:25,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:54:25,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:54:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972334876] [2024-10-13 04:54:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:54:25,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:54:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:54:25,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:54:25,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:54:25,129 INFO L87 Difference]: Start difference. First operand 273 states and 423 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:54:25,456 INFO L93 Difference]: Finished difference Result 411 states and 633 transitions. [2024-10-13 04:54:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:54:25,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-13 04:54:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:54:25,461 INFO L225 Difference]: With dead ends: 411 [2024-10-13 04:54:25,461 INFO L226 Difference]: Without dead ends: 301 [2024-10-13 04:54:25,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:54:25,464 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 90 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:54:25,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 483 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:54:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-13 04:54:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 264. [2024-10-13 04:54:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 207 states have (on average 1.4685990338164252) internal successors, (304), 207 states have internal predecessors, (304), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 04:54:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 408 transitions. [2024-10-13 04:54:25,486 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 408 transitions. Word has length 172 [2024-10-13 04:54:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:54:25,487 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 408 transitions. [2024-10-13 04:54:25,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 408 transitions. [2024-10-13 04:54:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 04:54:25,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:25,491 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:25,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 04:54:25,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:25,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -594405841, now seen corresponding path program 1 times [2024-10-13 04:54:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540356092] [2024-10-13 04:54:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:54:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:54:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:54:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:54:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:54:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:54:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:54:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:54:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:54:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:54:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:54:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:54:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:54:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:54:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:54:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:54:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:54:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:54:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:54:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:54:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:54:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:54:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:54:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:54:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 04:54:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:54:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 04:54:26,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:54:26,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540356092] [2024-10-13 04:54:26,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540356092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:54:26,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:54:26,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:54:26,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337228247] [2024-10-13 04:54:26,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:54:26,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:54:26,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:54:26,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:54:26,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:54:26,590 INFO L87 Difference]: Start difference. First operand 264 states and 408 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:54:26,983 INFO L93 Difference]: Finished difference Result 427 states and 651 transitions. [2024-10-13 04:54:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:54:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-13 04:54:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:54:26,987 INFO L225 Difference]: With dead ends: 427 [2024-10-13 04:54:26,987 INFO L226 Difference]: Without dead ends: 317 [2024-10-13 04:54:26,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:54:26,989 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 119 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:54:26,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 554 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:54:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-13 04:54:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2024-10-13 04:54:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 203 states have (on average 1.4532019704433496) internal successors, (295), 203 states have internal predecessors, (295), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 04:54:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 399 transitions. [2024-10-13 04:54:27,013 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 399 transitions. Word has length 173 [2024-10-13 04:54:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:54:27,013 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 399 transitions. [2024-10-13 04:54:27,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 399 transitions. [2024-10-13 04:54:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 04:54:27,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:27,016 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:27,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 04:54:27,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:27,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash 426906800, now seen corresponding path program 1 times [2024-10-13 04:54:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:27,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537662038] [2024-10-13 04:54:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:54:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:54:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:54:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:54:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:54:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:54:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:54:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:54:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:54:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:54:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:54:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:54:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:54:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:54:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:54:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:54:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:54:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:54:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:54:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:54:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:54:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:54:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:54:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:54:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 04:54:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:54:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:54:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 04:54:27,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:54:27,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537662038] [2024-10-13 04:54:27,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537662038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:54:27,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:54:27,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:54:27,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126787056] [2024-10-13 04:54:27,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:54:27,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:54:27,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:54:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:54:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:54:27,381 INFO L87 Difference]: Start difference. First operand 260 states and 399 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:54:27,557 INFO L93 Difference]: Finished difference Result 385 states and 591 transitions. [2024-10-13 04:54:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:54:27,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-10-13 04:54:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:54:27,560 INFO L225 Difference]: With dead ends: 385 [2024-10-13 04:54:27,560 INFO L226 Difference]: Without dead ends: 257 [2024-10-13 04:54:27,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:54:27,561 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 127 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:54:27,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 378 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:54:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-13 04:54:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-10-13 04:54:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 200 states have (on average 1.43) internal successors, (286), 200 states have internal predecessors, (286), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 04:54:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2024-10-13 04:54:27,582 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 174 [2024-10-13 04:54:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:54:27,582 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2024-10-13 04:54:27,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 04:54:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2024-10-13 04:54:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-13 04:54:27,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:54:27,586 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 04:54:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 04:54:27,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:54:27,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:54:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1382019593, now seen corresponding path program 1 times [2024-10-13 04:54:27,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:54:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750031481] [2024-10-13 04:54:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:54:27,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:54:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat