./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_fillercode_fillercodesize_ps-cn-25_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_fillercode_fillercodesize_ps-cn-25_file-31.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 f2a7802de7d6c018a654b8dc76a65528671ddde3d2fbd00a71f1029ac90f1ee7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:31:20,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:31:20,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:31:20,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:31:20,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:31:20,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:31:20,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:31:20,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:31:20,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:31:20,843 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:31:20,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:31:20,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:31:20,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:31:20,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:31:20,859 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:31:20,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:31:20,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:31:20,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:31:20,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:31:20,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:31:20,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:31:20,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:31:20,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:31:20,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:31:20,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:31:20,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:31:20,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:31:20,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:31:20,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:31:20,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:31:20,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:31:20,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:31:20,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:31:20,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:31:20,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:31:20,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:31:20,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:31:20,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:31:20,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:31:20,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:31:20,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:31:20,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:31:20,867 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 -> f2a7802de7d6c018a654b8dc76a65528671ddde3d2fbd00a71f1029ac90f1ee7 [2024-11-20 03:31:21,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:31:21,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:31:21,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:31:21,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:31:21,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:31:21,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-31.i [2024-11-20 03:31:22,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:31:22,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:31:22,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-31.i [2024-11-20 03:31:22,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f587bce23/302e5451895c452d825b4f9529c2c52a/FLAG9c7980ab3 [2024-11-20 03:31:22,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f587bce23/302e5451895c452d825b4f9529c2c52a [2024-11-20 03:31:22,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:31:22,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:31:22,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:31:22,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:31:22,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:31:22,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:31:22" (1/1) ... [2024-11-20 03:31:22,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413c8c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:22, skipping insertion in model container [2024-11-20 03:31:22,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:31:22" (1/1) ... [2024-11-20 03:31:22,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:31:23,175 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_ps-cn-25_file-31.i[915,928] [2024-11-20 03:31:23,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:31:23,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:31:23,299 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_ps-cn-25_file-31.i[915,928] [2024-11-20 03:31:23,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:31:23,407 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:31:23,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23 WrapperNode [2024-11-20 03:31:23,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:31:23,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:31:23,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:31:23,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:31:23,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,511 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2024-11-20 03:31:23,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:31:23,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:31:23,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:31:23,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:31:23,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,565 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-20 03:31:23,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:31:23,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:31:23,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:31:23,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:31:23,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (1/1) ... [2024-11-20 03:31:23,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:31:23,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:31:23,641 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-20 03:31:23,644 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-20 03:31:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:31:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:31:23,696 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:31:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:31:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:31:23,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:31:23,775 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:31:23,777 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:31:24,191 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 03:31:24,191 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:31:24,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:31:24,209 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:31:24,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:31:24 BoogieIcfgContainer [2024-11-20 03:31:24,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:31:24,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:31:24,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:31:24,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:31:24,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:31:22" (1/3) ... [2024-11-20 03:31:24,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7010953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:31:24, skipping insertion in model container [2024-11-20 03:31:24,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:23" (2/3) ... [2024-11-20 03:31:24,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7010953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:31:24, skipping insertion in model container [2024-11-20 03:31:24,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:31:24" (3/3) ... [2024-11-20 03:31:24,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-31.i [2024-11-20 03:31:24,233 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:31:24,233 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:31:24,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:31:24,301 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;@5173ab95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:31:24,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:31:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 60 states have internal predecessors, (79), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-20 03:31:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-20 03:31:24,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:31:24,323 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:31:24,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:31:24,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:31:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1012931672, now seen corresponding path program 1 times [2024-11-20 03:31:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:31:24,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500064961] [2024-11-20 03:31:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:31:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:31:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:31:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:31:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:31:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:31:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:31:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:31:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:31:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:31:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:31:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:31:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:31:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:31:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:31:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:31:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:31:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:31:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:31:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:31:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:31:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:31:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:31:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:31:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:31:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:31:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:31:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:31:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:31:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:31:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:31:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:31:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 03:31:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:31:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 03:31:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 03:31:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 03:31:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 03:31:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 03:31:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 03:31:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 03:31:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-20 03:31:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-20 03:31:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-20 03:31:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-20 03:31:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2024-11-20 03:31:24,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:31:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500064961] [2024-11-20 03:31:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500064961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:31:24,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:31:24,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:31:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101965108] [2024-11-20 03:31:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:31:24,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:31:24,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:31:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:31:24,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:31:24,997 INFO L87 Difference]: Start difference. First operand has 105 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 60 states have internal predecessors, (79), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-20 03:31:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:31:25,034 INFO L93 Difference]: Finished difference Result 203 states and 367 transitions. [2024-11-20 03:31:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:31:25,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 259 [2024-11-20 03:31:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:31:25,044 INFO L225 Difference]: With dead ends: 203 [2024-11-20 03:31:25,045 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 03:31:25,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-20 03:31:25,052 INFO L432 NwaCegarLoop]: 158 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, 158 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-20 03:31:25,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:31:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 03:31:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-20 03:31:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 states have internal predecessors, (72), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-20 03:31:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2024-11-20 03:31:25,111 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 259 [2024-11-20 03:31:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:31:25,112 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2024-11-20 03:31:25,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-20 03:31:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2024-11-20 03:31:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-20 03:31:25,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:31:25,121 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:31:25,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:31:25,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:31:25,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:31:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash 932930518, now seen corresponding path program 1 times [2024-11-20 03:31:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:31:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656837909] [2024-11-20 03:31:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:31:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:31:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:31:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:31:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:31:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:31:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:31:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:31:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:31:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:31:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:31:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:31:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:31:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:31:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:31:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:31:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:31:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:31:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:31:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:31:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:31:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:31:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:31:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:31:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:31:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:31:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:31:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:31:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:31:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:31:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:31:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:31:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 03:31:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:31:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 03:31:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 03:31:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-20 03:31:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 03:31:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-20 03:31:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 03:31:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-20 03:31:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-20 03:31:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-20 03:31:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-20 03:31:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-20 03:31:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:31:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2024-11-20 03:31:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:31:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656837909] [2024-11-20 03:31:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656837909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:31:25,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:31:25,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 03:31:25,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446846259] [2024-11-20 03:31:25,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:31:25,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 03:31:25,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:31:25,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 03:31:25,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:31:25,575 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2024-11-20 03:31:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:31:25,678 INFO L93 Difference]: Finished difference Result 296 states and 466 transitions. [2024-11-20 03:31:25,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 03:31:25,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 259 [2024-11-20 03:31:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:31:25,687 INFO L225 Difference]: With dead ends: 296 [2024-11-20 03:31:25,687 INFO L226 Difference]: Without dead ends: 198 [2024-11-20 03:31:25,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:31:25,692 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 146 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:31:25,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 446 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:31:25,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-20 03:31:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 105. [2024-11-20 03:31:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-20 03:31:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2024-11-20 03:31:25,723 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 259 [2024-11-20 03:31:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:31:25,725 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2024-11-20 03:31:25,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2024-11-20 03:31:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2024-11-20 03:31:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-20 03:31:25,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:31:25,729 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:31:25,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:31:25,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:31:25,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:31:25,730 INFO L85 PathProgramCache]: Analyzing trace with hash 123583892, now seen corresponding path program 1 times [2024-11-20 03:31:25,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:31:25,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008187823] [2024-11-20 03:31:25,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:31:25,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:31:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat