./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35897ca10739dfe50f578706614b96ade5d7e66bf9cbebf31dd49bae05c8bb42 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:20:25,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:20:25,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:20:25,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:20:25,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:20:25,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:20:25,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:20:25,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:20:25,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:20:25,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:20:25,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:20:25,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:20:25,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:20:25,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:20:25,693 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:20:25,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:20:25,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:20:25,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:20:25,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:20:25,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:20:25,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:20:25,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:20:25,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:20:25,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:20:25,697 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:20:25,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:20:25,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:20:25,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:20:25,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:20:25,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:20:25,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:20:25,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:20:25,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:20:25,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:20:25,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:20:25,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:20:25,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:20:25,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:20:25,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:20:25,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:20:25,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:20:25,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:20:25,702 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35897ca10739dfe50f578706614b96ade5d7e66bf9cbebf31dd49bae05c8bb42 [2024-10-14 12:20:25,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:20:26,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:20:26,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:20:26,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:20:26,026 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:20:26,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i [2024-10-14 12:20:27,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:20:27,763 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:20:27,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i [2024-10-14 12:20:27,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4315518/8414f6dc549d402ca1a7d50a3cca0f2a/FLAG7cc8ae7d7 [2024-10-14 12:20:28,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4315518/8414f6dc549d402ca1a7d50a3cca0f2a [2024-10-14 12:20:28,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:20:28,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:20:28,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:20:28,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:20:28,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:20:28,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451dbe96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28, skipping insertion in model container [2024-10-14 12:20:28,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:20:28,320 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i[916,929] [2024-10-14 12:20:28,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:20:28,477 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:20:28,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i[916,929] [2024-10-14 12:20:28,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:20:28,587 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:20:28,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28 WrapperNode [2024-10-14 12:20:28,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:20:28,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:20:28,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:20:28,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:20:28,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,682 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-10-14 12:20:28,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:20:28,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:20:28,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:20:28,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:20:28,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,747 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:20:28,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:20:28,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:20:28,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:20:28,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:20:28,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (1/1) ... [2024-10-14 12:20:28,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:20:28,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:20:28,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:20:28,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:20:28,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:20:28,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:20:28,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:20:28,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:20:28,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:20:28,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:20:29,011 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:20:29,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:20:29,614 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-14 12:20:29,615 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:20:29,663 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:20:29,664 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:20:29,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:20:29 BoogieIcfgContainer [2024-10-14 12:20:29,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:20:29,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:20:29,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:20:29,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:20:29,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:20:28" (1/3) ... [2024-10-14 12:20:29,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5aef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:20:29, skipping insertion in model container [2024-10-14 12:20:29,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:20:28" (2/3) ... [2024-10-14 12:20:29,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5aef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:20:29, skipping insertion in model container [2024-10-14 12:20:29,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:20:29" (3/3) ... [2024-10-14 12:20:29,677 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-57.i [2024-10-14 12:20:29,739 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:20:29,739 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:20:29,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:20:29,821 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;@3e674761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:20:29,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:20:29,828 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-14 12:20:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-14 12:20:29,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:20:29,845 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-14 12:20:29,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:20:29,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:20:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash -96782062, now seen corresponding path program 1 times [2024-10-14 12:20:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:20:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666727398] [2024-10-14 12:20:29,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:20:29,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:20:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:20:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:20:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:20:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:20:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:20:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:20:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:20:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:20:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:20:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:20:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:20:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:20:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:20:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:20:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:20:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:20:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:20:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 12:20:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 12:20:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 12:20:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 12:20:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 12:20:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 12:20:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 12:20:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 12:20:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 12:20:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 12:20:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 12:20:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 12:20:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 12:20:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 12:20:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 12:20:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 12:20:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 12:20:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 12:20:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 12:20:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:30,511 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-14 12:20:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:20:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666727398] [2024-10-14 12:20:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666727398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:20:30,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:20:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:20:30,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94626409] [2024-10-14 12:20:30,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:20:30,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:20:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:20:30,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:20:30,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:20:30,556 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-14 12:20:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:20:30,610 INFO L93 Difference]: Finished difference Result 207 states and 376 transitions. [2024-10-14 12:20:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:20:30,615 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-14 12:20:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:20:30,637 INFO L225 Difference]: With dead ends: 207 [2024-10-14 12:20:30,641 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 12:20:30,646 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-14 12:20:30,654 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:20:30,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:20:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 12:20:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-14 12:20:30,734 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-14 12:20:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2024-10-14 12:20:30,745 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 223 [2024-10-14 12:20:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:20:30,746 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2024-10-14 12:20:30,746 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-14 12:20:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2024-10-14 12:20:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-14 12:20:30,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:20:30,757 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-14 12:20:30,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:20:30,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:20:30,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:20:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1042333594, now seen corresponding path program 1 times [2024-10-14 12:20:30,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:20:30,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216895760] [2024-10-14 12:20:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:20:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:20:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:20:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:20:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:20:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:20:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:20:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:20:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:20:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:20:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:20:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:20:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:20:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:20:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:20:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:20:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:20:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:20:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:20:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 12:20:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 12:20:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 12:20:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 12:20:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 12:20:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 12:20:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 12:20:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 12:20:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 12:20:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 12:20:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 12:20:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 12:20:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 12:20:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 12:20:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 12:20:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 12:20:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 12:20:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 12:20:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 12:20:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:20:56,208 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-14 12:20:56,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:20:56,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216895760] [2024-10-14 12:20:56,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216895760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:20:56,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:20:56,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 12:20:56,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741393003] [2024-10-14 12:20:56,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:20:56,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 12:20:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:20:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 12:20:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 12:20:56,215 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-14 12:20:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:20:58,252 INFO L93 Difference]: Finished difference Result 331 states and 525 transitions. [2024-10-14 12:20:58,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:20:58,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-14 12:20:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:20:58,260 INFO L225 Difference]: With dead ends: 331 [2024-10-14 12:20:58,260 INFO L226 Difference]: Without dead ends: 229 [2024-10-14 12:20:58,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:20:58,263 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 192 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 12:20:58,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 755 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 12:20:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-14 12:20:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 119. [2024-10-14 12:20:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.4938271604938271) internal successors, (121), 81 states have internal predecessors, (121), 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-14 12:20:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 193 transitions. [2024-10-14 12:20:58,286 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 193 transitions. Word has length 223 [2024-10-14 12:20:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:20:58,290 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 193 transitions. [2024-10-14 12:20:58,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-14 12:20:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 193 transitions. [2024-10-14 12:20:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-14 12:20:58,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:20:58,299 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-14 12:20:58,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:20:58,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:20:58,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:20:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1592442856, now seen corresponding path program 1 times [2024-10-14 12:20:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:20:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014626584] [2024-10-14 12:20:58,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:20:58,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:20:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:21:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:21:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:21:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:21:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:21:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:21:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:21:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:21:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:21:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:21:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:21:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:21:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:21:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:21:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:21:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:21:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:21:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 12:21:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 12:21:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 12:21:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 12:21:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 12:21:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 12:21:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 12:21:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 12:21:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 12:21:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 12:21:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 12:21:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 12:21:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 12:21:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 12:21:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 12:21:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 12:21:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 12:21:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 12:21:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 12:21:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:17,610 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-14 12:21:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:21:17,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014626584] [2024-10-14 12:21:17,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014626584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:21:17,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:21:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 12:21:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128241176] [2024-10-14 12:21:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:21:17,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 12:21:17,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:21:17,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 12:21:17,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 12:21:17,617 INFO L87 Difference]: Start difference. First operand 119 states and 193 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-14 12:21:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:21:23,103 INFO L93 Difference]: Finished difference Result 477 states and 761 transitions. [2024-10-14 12:21:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 12:21:23,104 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-14 12:21:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:21:23,109 INFO L225 Difference]: With dead ends: 477 [2024-10-14 12:21:23,110 INFO L226 Difference]: Without dead ends: 359 [2024-10-14 12:21:23,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 12:21:23,113 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 480 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 12:21:23,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 768 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 12:21:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-14 12:21:23,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 198. [2024-10-14 12:21:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 123 states have internal predecessors, (178), 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-14 12:21:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 322 transitions. [2024-10-14 12:21:23,157 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 322 transitions. Word has length 224 [2024-10-14 12:21:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:21:23,158 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 322 transitions. [2024-10-14 12:21:23,158 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-14 12:21:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 322 transitions. [2024-10-14 12:21:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-14 12:21:23,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:21:23,162 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-14 12:21:23,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:21:23,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:21:23,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:21:23,163 INFO L85 PathProgramCache]: Analyzing trace with hash -121850114, now seen corresponding path program 1 times [2024-10-14 12:21:23,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:21:23,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786708551] [2024-10-14 12:21:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:21:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:21:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:21:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:21:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:21:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:21:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:21:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:21:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:21:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:21:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:21:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:21:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:21:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:21:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:21:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:21:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:21:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:21:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:21:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 12:21:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 12:21:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 12:21:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 12:21:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 12:21:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 12:21:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 12:21:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 12:21:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 12:21:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 12:21:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 12:21:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 12:21:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 12:21:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 12:21:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 12:21:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 12:21:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 12:21:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 12:21:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 12:21:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:21:31,006 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-14 12:21:31,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:21:31,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786708551] [2024-10-14 12:21:31,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786708551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:21:31,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:21:31,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 12:21:31,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625651601] [2024-10-14 12:21:31,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:21:31,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 12:21:31,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:21:31,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 12:21:31,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:21:31,010 INFO L87 Difference]: Start difference. First operand 198 states and 322 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 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-14 12:21:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:21:32,609 INFO L93 Difference]: Finished difference Result 508 states and 802 transitions. [2024-10-14 12:21:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 12:21:32,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 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-14 12:21:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:21:32,614 INFO L225 Difference]: With dead ends: 508 [2024-10-14 12:21:32,614 INFO L226 Difference]: Without dead ends: 390 [2024-10-14 12:21:32,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-10-14 12:21:32,617 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 500 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 12:21:32,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 796 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 12:21:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-14 12:21:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 217. [2024-10-14 12:21:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 142 states have (on average 1.4859154929577465) internal successors, (211), 142 states have internal predecessors, (211), 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-14 12:21:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 355 transitions. [2024-10-14 12:21:32,645 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 355 transitions. Word has length 224 [2024-10-14 12:21:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:21:32,646 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 355 transitions. [2024-10-14 12:21:32,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 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-14 12:21:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 355 transitions. [2024-10-14 12:21:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-14 12:21:32,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:21:32,650 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-14 12:21:32,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:21:32,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:21:32,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:21:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash 418215876, now seen corresponding path program 1 times [2024-10-14 12:21:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:21:32,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555462183] [2024-10-14 12:21:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:21:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:21:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat