./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-64.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 71592c21a828683409fd35e3c804ae28adae470b26e65a289a52fb5caf24a9a0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:00:15,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:00:15,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:00:15,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:00:15,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:00:15,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:00:15,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:00:15,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:00:15,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:00:15,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:00:15,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:00:15,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:00:15,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:00:15,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:00:15,812 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:00:15,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:00:15,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:00:15,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:00:15,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:00:15,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:00:15,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:00:15,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:00:15,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:00:15,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:00:15,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:00:15,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:00:15,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:00:15,819 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:00:15,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:00:15,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:00:15,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:00:15,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:00:15,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:00:15,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:00:15,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:00:15,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:00:15,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:00:15,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:00:15,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:00:15,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:00:15,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:00:15,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:00:15,822 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 -> 71592c21a828683409fd35e3c804ae28adae470b26e65a289a52fb5caf24a9a0 [2024-11-08 20:00:16,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:00:16,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:00:16,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:00:16,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:00:16,054 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:00:16,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-64.i [2024-11-08 20:00:17,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:00:17,673 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:00:17,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-64.i [2024-11-08 20:00:17,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfc2dfef/226da24ef96248a7be77258b13f283d9/FLAG11dd4316e [2024-11-08 20:00:17,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfc2dfef/226da24ef96248a7be77258b13f283d9 [2024-11-08 20:00:17,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:00:17,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:00:17,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:00:17,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:00:17,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:00:17,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:17,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b29297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17, skipping insertion in model container [2024-11-08 20:00:17,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:17,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:00:17,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-64.i[913,926] [2024-11-08 20:00:17,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:00:17,937 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:00:17,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-64.i[913,926] [2024-11-08 20:00:17,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:00:17,977 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:00:17,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17 WrapperNode [2024-11-08 20:00:17,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:00:17,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:00:17,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:00:17,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:00:17,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:17,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,021 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-08 20:00:18,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:00:18,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:00:18,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:00:18,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:00:18,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,058 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:00:18,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:00:18,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:00:18,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:00:18,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:00:18,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (1/1) ... [2024-11-08 20:00:18,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:00:18,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:00:18,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:00:18,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:00:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:00:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:00:18,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:00:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:00:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:00:18,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:00:18,214 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:00:18,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:00:18,544 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:00:18,544 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:00:18,560 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:00:18,560 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:00:18,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:00:18 BoogieIcfgContainer [2024-11-08 20:00:18,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:00:18,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:00:18,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:00:18,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:00:18,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:00:17" (1/3) ... [2024-11-08 20:00:18,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1226339c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:00:18, skipping insertion in model container [2024-11-08 20:00:18,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:00:17" (2/3) ... [2024-11-08 20:00:18,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1226339c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:00:18, skipping insertion in model container [2024-11-08 20:00:18,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:00:18" (3/3) ... [2024-11-08 20:00:18,567 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-64.i [2024-11-08 20:00:18,583 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:00:18,584 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:00:18,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:00:18,653 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;@56d5c49b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:00:18,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:00:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 20:00:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 20:00:18,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:18,687 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:18,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:18,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1472419692, now seen corresponding path program 1 times [2024-11-08 20:00:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:18,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408255833] [2024-11-08 20:00:18,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:18,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:00:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:00:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:00:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:00:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:00:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:00:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:00:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:00:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:00:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:00:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:00:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:00:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:00:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:00:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:00:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:00:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:00:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:00:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:00:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 20:00:19,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:19,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408255833] [2024-11-08 20:00:19,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408255833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:19,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:19,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:00:19,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704507442] [2024-11-08 20:00:19,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:19,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:00:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:19,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:00:19,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:00:19,185 INFO L87 Difference]: Start difference. First operand has 75 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 20:00:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:19,253 INFO L93 Difference]: Finished difference Result 143 states and 250 transitions. [2024-11-08 20:00:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:00:19,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2024-11-08 20:00:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:19,265 INFO L225 Difference]: With dead ends: 143 [2024-11-08 20:00:19,265 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 20:00:19,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:00:19,274 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:19,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:00:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 20:00:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 20:00:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 20:00:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-11-08 20:00:19,339 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 163 [2024-11-08 20:00:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:19,342 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-11-08 20:00:19,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 20:00:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-11-08 20:00:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 20:00:19,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:19,347 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:19,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:00:19,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:19,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash -688375340, now seen corresponding path program 1 times [2024-11-08 20:00:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:19,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503889447] [2024-11-08 20:00:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:00:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:00:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:00:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:00:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:00:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:00:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:00:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:00:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:00:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:00:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:00:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:00:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:00:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:00:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:00:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:00:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:00:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:00:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:00:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 20:00:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503889447] [2024-11-08 20:00:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503889447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:21,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:21,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:00:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874502016] [2024-11-08 20:00:21,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:21,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:00:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:00:21,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:00:21,797 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:00:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:22,105 INFO L93 Difference]: Finished difference Result 247 states and 378 transitions. [2024-11-08 20:00:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:00:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2024-11-08 20:00:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:22,109 INFO L225 Difference]: With dead ends: 247 [2024-11-08 20:00:22,109 INFO L226 Difference]: Without dead ends: 179 [2024-11-08 20:00:22,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:00:22,110 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 128 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:22,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 464 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:00:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-08 20:00:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 75. [2024-11-08 20:00:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 20:00:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2024-11-08 20:00:22,123 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 163 [2024-11-08 20:00:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:22,125 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2024-11-08 20:00:22,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:00:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2024-11-08 20:00:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 20:00:22,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:22,127 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:22,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:00:22,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:22,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -171222316, now seen corresponding path program 1 times [2024-11-08 20:00:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:22,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948021201] [2024-11-08 20:00:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:00:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:00:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:00:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:00:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:00:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:00:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:00:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:00:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:00:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:00:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:00:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:00:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:00:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:00:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:00:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:00:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:00:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:00:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:00:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 20:00:23,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948021201] [2024-11-08 20:00:23,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948021201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:23,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:23,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:00:23,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474303739] [2024-11-08 20:00:23,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:23,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:00:23,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:23,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:00:23,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:00:23,642 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:00:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:23,859 INFO L93 Difference]: Finished difference Result 206 states and 313 transitions. [2024-11-08 20:00:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:00:23,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2024-11-08 20:00:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:23,863 INFO L225 Difference]: With dead ends: 206 [2024-11-08 20:00:23,864 INFO L226 Difference]: Without dead ends: 134 [2024-11-08 20:00:23,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:00:23,866 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 109 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:23,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 567 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:00:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-08 20:00:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2024-11-08 20:00:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 20:00:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2024-11-08 20:00:23,886 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 163 [2024-11-08 20:00:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:23,886 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2024-11-08 20:00:23,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:00:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2024-11-08 20:00:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 20:00:23,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:23,892 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:23,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:00:23,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:23,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash -652193233, now seen corresponding path program 1 times [2024-11-08 20:00:23,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:23,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103700651] [2024-11-08 20:00:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:23,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:00:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:00:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:00:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:00:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:00:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:00:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:00:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:00:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:00:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:00:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:00:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:00:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:00:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:00:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:00:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:00:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:00:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:00:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:00:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:00:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:00:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:00:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:00:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:00:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:00:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:00:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:00:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 20:00:27,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:00:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103700651] [2024-11-08 20:00:27,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103700651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:00:27,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:00:27,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 20:00:27,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62853591] [2024-11-08 20:00:27,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:00:27,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:00:27,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:00:27,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:00:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:00:27,055 INFO L87 Difference]: Start difference. First operand 71 states and 107 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:00:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:00:27,792 INFO L93 Difference]: Finished difference Result 315 states and 450 transitions. [2024-11-08 20:00:27,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:00:27,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-11-08 20:00:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:00:27,795 INFO L225 Difference]: With dead ends: 315 [2024-11-08 20:00:27,795 INFO L226 Difference]: Without dead ends: 247 [2024-11-08 20:00:27,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:00:27,800 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 311 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:00:27,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 335 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 20:00:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-08 20:00:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 171. [2024-11-08 20:00:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 123 states have internal predecessors, (161), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 20:00:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 253 transitions. [2024-11-08 20:00:27,838 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 253 transitions. Word has length 165 [2024-11-08 20:00:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:00:27,839 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 253 transitions. [2024-11-08 20:00:27,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:00:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 253 transitions. [2024-11-08 20:00:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 20:00:27,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:00:27,841 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:00:27,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:00:27,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:00:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:00:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1045220243, now seen corresponding path program 1 times [2024-11-08 20:00:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:00:27,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761545728] [2024-11-08 20:00:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:00:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:00:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat