./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_loopvsstraightlinecode_100-1loop_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 129eb72cba2ec6662c92062b72f302d538a3dfe4c41c05f2b8937451c2edd34a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:07:53,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:07:53,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:07:53,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:07:53,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:07:53,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:07:53,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:07:53,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:07:53,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:07:53,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:07:53,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:07:53,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:07:53,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:07:53,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:07:53,436 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:07:53,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:07:53,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:07:53,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:07:53,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:07:53,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:07:53,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:07:53,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:07:53,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:07:53,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:07:53,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:07:53,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:07:53,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:07:53,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:07:53,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:07:53,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:07:53,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:07:53,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:07:53,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:07:53,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:07:53,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:07:53,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:07:53,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:07:53,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:07:53,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:07:53,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:07:53,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:07:53,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:07:53,456 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-clean/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-clean/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 -> 129eb72cba2ec6662c92062b72f302d538a3dfe4c41c05f2b8937451c2edd34a [2024-10-11 11:07:53,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:07:53,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:07:53,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:07:53,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:07:53,694 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:07:53,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i [2024-10-11 11:07:54,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:07:55,108 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:07:55,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i [2024-10-11 11:07:55,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9cd711d95/a8ead9af0adf454393f06c093f7e9644/FLAG3a6385fe8 [2024-10-11 11:07:55,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9cd711d95/a8ead9af0adf454393f06c093f7e9644 [2024-10-11 11:07:55,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:07:55,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:07:55,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:07:55,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:07:55,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:07:55,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93d69d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55, skipping insertion in model container [2024-10-11 11:07:55,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:07:55,679 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_loopvsstraightlinecode_100-1loop_file-57.i[916,929] [2024-10-11 11:07:55,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:07:55,746 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:07:55,759 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_loopvsstraightlinecode_100-1loop_file-57.i[916,929] [2024-10-11 11:07:55,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:07:55,819 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:07:55,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55 WrapperNode [2024-10-11 11:07:55,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:07:55,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:07:55,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:07:55,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:07:55,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,892 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 261 [2024-10-11 11:07:55,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:07:55,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:07:55,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:07:55,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:07:55,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,934 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-11 11:07:55,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:07:55,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:07:55,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:07:55,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:07:55,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (1/1) ... [2024-10-11 11:07:55,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:07:55,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:07:55,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:07:55,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:07:56,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:07:56,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:07:56,034 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:07:56,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:07:56,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:07:56,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:07:56,125 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:07:56,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:07:56,510 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-11 11:07:56,510 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:07:56,567 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:07:56,567 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:07:56,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:07:56 BoogieIcfgContainer [2024-10-11 11:07:56,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:07:56,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:07:56,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:07:56,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:07:56,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:07:55" (1/3) ... [2024-10-11 11:07:56,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b31bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:07:56, skipping insertion in model container [2024-10-11 11:07:56,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:07:55" (2/3) ... [2024-10-11 11:07:56,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b31bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:07:56, skipping insertion in model container [2024-10-11 11:07:56,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:07:56" (3/3) ... [2024-10-11 11:07:56,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-57.i [2024-10-11 11:07:56,587 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:07:56,587 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:07:56,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:07:56,642 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;@14a2159d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:07:56,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:07:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:07:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 11:07:56,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:07:56,661 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:07:56,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:07:56,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:07:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1326875915, now seen corresponding path program 1 times [2024-10-11 11:07:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:07:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735663752] [2024-10-11 11:07:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:07:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:07:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:07:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:07:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:07:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:07:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:07:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:07:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:07:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:07:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:07:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:07:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:07:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:07:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:07:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:07:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:56,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:07:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:07:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:07:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:07:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:07:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:07:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:07:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:07:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:07:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:07:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:07:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:07:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:07:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:07:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:07:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:07:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:07:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:07:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:07:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:07:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:07:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:07:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:07:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:07:57,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735663752] [2024-10-11 11:07:57,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735663752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:07:57,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:07:57,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:07:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946637892] [2024-10-11 11:07:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:07:57,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:07:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:07:57,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:07:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:07:57,103 INFO L87 Difference]: Start difference. First operand has 105 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:07:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:07:57,148 INFO L93 Difference]: Finished difference Result 209 states and 377 transitions. [2024-10-11 11:07:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:07:57,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 223 [2024-10-11 11:07:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:07:57,158 INFO L225 Difference]: With dead ends: 209 [2024-10-11 11:07:57,158 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 11:07:57,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-11 11:07:57,164 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:07:57,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:07:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 11:07:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 11:07:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:07:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2024-10-11 11:07:57,201 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 223 [2024-10-11 11:07:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:07:57,202 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2024-10-11 11:07:57,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:07:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2024-10-11 11:07:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 11:07:57,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:07:57,206 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:07:57,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:07:57,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:07:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:07:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1828975725, now seen corresponding path program 1 times [2024-10-11 11:07:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:07:57,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145191433] [2024-10-11 11:07:57,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:07:57,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:07:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:08:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:08:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:08:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:08:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:08:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:08:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:08:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:08:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:08:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:08:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:08:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:08:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:08:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:08:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:08:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:08:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:08:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145191433] [2024-10-11 11:08:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145191433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:15,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:15,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 11:08:15,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730177560] [2024-10-11 11:08:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:15,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:08:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:08:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:08:15,291 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:08:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:18,018 INFO L93 Difference]: Finished difference Result 450 states and 721 transitions. [2024-10-11 11:08:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 11:08:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 223 [2024-10-11 11:08:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:18,024 INFO L225 Difference]: With dead ends: 450 [2024-10-11 11:08:18,024 INFO L226 Difference]: Without dead ends: 348 [2024-10-11 11:08:18,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-10-11 11:08:18,029 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 649 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:18,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 798 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 11:08:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-11 11:08:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 189. [2024-10-11 11:08:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 11:08:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 305 transitions. [2024-10-11 11:08:18,080 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 305 transitions. Word has length 223 [2024-10-11 11:08:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:18,080 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 305 transitions. [2024-10-11 11:08:18,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:08:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 305 transitions. [2024-10-11 11:08:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 11:08:18,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:18,087 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:08:18,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:08:18,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:18,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1186127893, now seen corresponding path program 1 times [2024-10-11 11:08:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:18,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104405347] [2024-10-11 11:08:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:08:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:08:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:08:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:08:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:08:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:08:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:08:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:08:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:08:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:08:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:08:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:08:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:08:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:08:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:08:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:08:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:08:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104405347] [2024-10-11 11:08:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104405347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:08:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049757600] [2024-10-11 11:08:27,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:27,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:08:27,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:27,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:08:27,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:08:27,645 INFO L87 Difference]: Start difference. First operand 189 states and 305 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:08:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:28,568 INFO L93 Difference]: Finished difference Result 403 states and 646 transitions. [2024-10-11 11:08:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:08:28,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-10-11 11:08:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:28,574 INFO L225 Difference]: With dead ends: 403 [2024-10-11 11:08:28,575 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 11:08:28,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:08:28,579 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 276 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:28,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 458 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 11:08:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 11:08:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 122. [2024-10-11 11:08:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 84 states have (on average 1.5) internal successors, (126), 84 states have internal predecessors, (126), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:08:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 198 transitions. [2024-10-11 11:08:28,597 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 198 transitions. Word has length 223 [2024-10-11 11:08:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:28,598 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 198 transitions. [2024-10-11 11:08:28,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:08:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 198 transitions. [2024-10-11 11:08:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 11:08:28,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:28,600 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:08:28,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:08:28,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1518857774, now seen corresponding path program 1 times [2024-10-11 11:08:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:28,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346997945] [2024-10-11 11:08:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:28,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:08:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:08:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:08:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:08:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:08:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:08:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:08:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:08:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:08:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:08:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:08:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:08:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:08:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:08:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:08:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:08:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:08:38,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346997945] [2024-10-11 11:08:38,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346997945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:38,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 11:08:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904137758] [2024-10-11 11:08:38,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:38,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:08:38,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:38,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:08:38,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:08:38,809 INFO L87 Difference]: Start difference. First operand 122 states and 198 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:08:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:43,510 INFO L93 Difference]: Finished difference Result 510 states and 820 transitions. [2024-10-11 11:08:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 11:08:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2024-10-11 11:08:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:43,513 INFO L225 Difference]: With dead ends: 510 [2024-10-11 11:08:43,513 INFO L226 Difference]: Without dead ends: 389 [2024-10-11 11:08:43,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2024-10-11 11:08:43,514 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 627 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:43,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 825 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 11:08:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-11 11:08:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 201. [2024-10-11 11:08:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 126 states have (on average 1.4523809523809523) internal successors, (183), 126 states have internal predecessors, (183), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 11:08:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 327 transitions. [2024-10-11 11:08:43,533 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 327 transitions. Word has length 224 [2024-10-11 11:08:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:43,534 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 327 transitions. [2024-10-11 11:08:43,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:08:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 327 transitions. [2024-10-11 11:08:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 11:08:43,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:43,536 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:08:43,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:08:43,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:43,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash -27141030, now seen corresponding path program 1 times [2024-10-11 11:08:43,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:43,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947982887] [2024-10-11 11:08:43,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:43,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:08:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:08:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:08:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:08:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:08:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:08:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:08:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:08:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:08:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:08:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:08:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:08:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:08:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:08:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:08:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:08:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:08:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947982887] [2024-10-11 11:08:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947982887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:52,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:52,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:08:52,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2270894] [2024-10-11 11:08:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:52,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:08:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:52,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:08:52,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:08:52,727 INFO L87 Difference]: Start difference. First operand 201 states and 327 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:08:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:54,309 INFO L93 Difference]: Finished difference Result 473 states and 756 transitions. [2024-10-11 11:08:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 11:08:54,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2024-10-11 11:08:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:54,312 INFO L225 Difference]: With dead ends: 473 [2024-10-11 11:08:54,313 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 11:08:54,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:08:54,314 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 357 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:54,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 696 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 11:08:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 11:08:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 203. [2024-10-11 11:08:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 128 states have (on average 1.4609375) internal successors, (187), 128 states have internal predecessors, (187), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 11:08:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 331 transitions. [2024-10-11 11:08:54,330 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 331 transitions. Word has length 224 [2024-10-11 11:08:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:54,330 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 331 transitions. [2024-10-11 11:08:54,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:08:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 331 transitions. [2024-10-11 11:08:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 11:08:54,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:54,332 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:08:54,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:08:54,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:54,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1921615186, now seen corresponding path program 1 times [2024-10-11 11:08:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950256789] [2024-10-11 11:08:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:09:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:09:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:09:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:09:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:09:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:09:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:09:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:09:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:09:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:09:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:09:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:09:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:09:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:09:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:09:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:09:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:09:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:09:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:09:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:09:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:09:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:09:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:09:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:09:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:09:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:09:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:09:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:09:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:09:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:09:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:09:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:09:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:09:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:09:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:09:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:09:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:09:13,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:09:13,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950256789] [2024-10-11 11:09:13,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950256789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:09:13,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:09:13,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 11:09:13,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779290300] [2024-10-11 11:09:13,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:09:13,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 11:09:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:09:13,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 11:09:13,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-11 11:09:13,901 INFO L87 Difference]: Start difference. First operand 203 states and 331 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:09:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:09:20,019 INFO L93 Difference]: Finished difference Result 610 states and 972 transitions. [2024-10-11 11:09:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 11:09:20,019 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 224 [2024-10-11 11:09:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:09:20,022 INFO L225 Difference]: With dead ends: 610 [2024-10-11 11:09:20,022 INFO L226 Difference]: Without dead ends: 487 [2024-10-11 11:09:20,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 11:09:20,024 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 950 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:09:20,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1109 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 11:09:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-10-11 11:09:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 210. [2024-10-11 11:09:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 11:09:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 344 transitions. [2024-10-11 11:09:20,039 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 344 transitions. Word has length 224 [2024-10-11 11:09:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:09:20,039 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 344 transitions. [2024-10-11 11:09:20,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:09:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 344 transitions. [2024-10-11 11:09:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 11:09:20,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:20,041 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:09:20,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:09:20,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:20,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1672287532, now seen corresponding path program 1 times [2024-10-11 11:09:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:20,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610538094] [2024-10-11 11:09:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat