./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_variablewrapping_wrapper-s_file-14.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_variablewrapping_wrapper-s_file-14.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 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:53:51,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:53:51,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:53:51,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:53:51,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:53:51,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:53:51,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:53:51,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:53:51,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:53:51,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:53:51,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:53:51,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:53:51,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:53:51,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:53:51,861 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:53:51,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:53:51,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:53:51,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:53:51,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:53:51,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:53:51,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:53:51,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:53:51,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:53:51,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:53:51,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:53:51,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:53:51,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:53:51,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:53:51,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:53:51,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:53:51,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:53:51,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:53:51,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:53:51,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:53:51,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:53:51,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:53:51,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:53:51,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:53:51,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:53:51,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:53:51,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:53:51,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:53:51,871 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 -> 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d [2024-11-20 08:53:52,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:53:52,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:53:52,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:53:52,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:53:52,092 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:53:52,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2024-11-20 08:53:53,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:53:53,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:53:53,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2024-11-20 08:53:53,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9cb5295/eced42c28e234dc3ad39b8695c12ec47/FLAGc886cfd1c [2024-11-20 08:53:53,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9cb5295/eced42c28e234dc3ad39b8695c12ec47 [2024-11-20 08:53:53,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:53:53,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:53:53,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:53:53,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:53:53,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:53:53,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:53:53" (1/1) ... [2024-11-20 08:53:53,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a13555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:53, skipping insertion in model container [2024-11-20 08:53:53,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:53:53" (1/1) ... [2024-11-20 08:53:53,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:53:53,877 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_variablewrapping_wrapper-s_file-14.i[916,929] [2024-11-20 08:53:53,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:53:53,951 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:53:53,960 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_variablewrapping_wrapper-s_file-14.i[916,929] [2024-11-20 08:53:54,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:53:54,075 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:53:54,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54 WrapperNode [2024-11-20 08:53:54,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:53:54,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:53:54,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:53:54,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:53:54,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,161 INFO L138 Inliner]: procedures = 30, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 561 [2024-11-20 08:53:54,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:53:54,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:53:54,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:53:54,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:53:54,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,204 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 08:53:54,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:53:54,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:53:54,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:53:54,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:53:54,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (1/1) ... [2024-11-20 08:53:54,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:53:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:53:54,282 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 08:53:54,295 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 08:53:54,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:53:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 08:53:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 08:53:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 08:53:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 08:53:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 08:53:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 08:53:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:53:54,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:53:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 08:53:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:53:54,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:53:54,452 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:53:54,454 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:53:55,000 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-11-20 08:53:55,000 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:53:55,010 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:53:55,011 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:53:55,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:53:55 BoogieIcfgContainer [2024-11-20 08:53:55,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:53:55,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:53:55,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:53:55,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:53:55,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:53:53" (1/3) ... [2024-11-20 08:53:55,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0fb76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:53:55, skipping insertion in model container [2024-11-20 08:53:55,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:53:54" (2/3) ... [2024-11-20 08:53:55,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0fb76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:53:55, skipping insertion in model container [2024-11-20 08:53:55,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:53:55" (3/3) ... [2024-11-20 08:53:55,017 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-14.i [2024-11-20 08:53:55,028 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:53:55,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:53:55,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:53:55,078 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;@2ff453af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:53:55,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:53:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:53:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:53:55,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:53:55,100 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:55,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:53:55,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:53:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash 774334680, now seen corresponding path program 1 times [2024-11-20 08:53:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:53:55,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160390881] [2024-11-20 08:53:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:53:55,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:53:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:53:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:53:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:53:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:53:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:53:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:53:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:53:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:53:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:53:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:53:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:53:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:53:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:53:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:53:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:53:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:53:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:53:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:53:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:53:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:53:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:53:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:53:55,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:53:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160390881] [2024-11-20 08:53:55,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160390881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:53:55,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:53:55,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:53:55,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799460926] [2024-11-20 08:53:55,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:53:55,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:53:55,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:53:55,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:53:55,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:53:55,596 INFO L87 Difference]: Start difference. First operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:53:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:53:55,667 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-20 08:53:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:53:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-20 08:53:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:53:55,676 INFO L225 Difference]: With dead ends: 249 [2024-11-20 08:53:55,676 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 08:53:55,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 08:53:55,683 INFO L432 NwaCegarLoop]: 183 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, 183 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 08:53:55,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:53:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 08:53:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-20 08:53:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:53:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-20 08:53:55,727 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-20 08:53:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:53:55,727 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-20 08:53:55,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:53:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-20 08:53:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:53:55,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:53:55,733 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:55,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:53:55,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:53:55,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:53:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash -812687366, now seen corresponding path program 1 times [2024-11-20 08:53:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:53:55,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698333140] [2024-11-20 08:53:55,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:53:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:53:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:53:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:53:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:53:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:53:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:53:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:53:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:53:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:53:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:53:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:53:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:53:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:53:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:53:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:53:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:53:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:53:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:53:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:53:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:53:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:53:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:53:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:53:56,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:53:56,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698333140] [2024-11-20 08:53:56,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698333140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:53:56,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:53:56,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:53:56,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671806697] [2024-11-20 08:53:56,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:53:56,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:53:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:53:56,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:53:56,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:53:56,048 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:53:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:53:56,087 INFO L93 Difference]: Finished difference Result 247 states and 366 transitions. [2024-11-20 08:53:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:53:56,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-20 08:53:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:53:56,090 INFO L225 Difference]: With dead ends: 247 [2024-11-20 08:53:56,090 INFO L226 Difference]: Without dead ends: 126 [2024-11-20 08:53:56,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:53:56,092 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:53:56,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:53:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-20 08:53:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-20 08:53:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:53:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-20 08:53:56,104 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 168 [2024-11-20 08:53:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:53:56,105 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-20 08:53:56,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:53:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-20 08:53:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:53:56,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:53:56,107 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:56,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:53:56,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:53:56,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:53:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1052927112, now seen corresponding path program 1 times [2024-11-20 08:53:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:53:56,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750509366] [2024-11-20 08:53:56,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:53:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:53:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:53:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:53:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:53:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:53:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:53:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:53:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:53:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:53:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:53:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:53:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:53:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:53:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:53:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:53:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:53:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:53:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:53:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:53:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:53:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:53:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:53:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:53:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:53:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750509366] [2024-11-20 08:53:56,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750509366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:53:56,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:53:56,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:53:56,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749980733] [2024-11-20 08:53:56,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:53:56,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:53:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:53:56,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:53:56,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:53:56,363 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:53:56,378 INFO L93 Difference]: Finished difference Result 250 states and 369 transitions. [2024-11-20 08:53:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:53:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-20 08:53:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:53:56,379 INFO L225 Difference]: With dead ends: 250 [2024-11-20 08:53:56,379 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 08:53:56,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 08:53:56,381 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:53:56,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:53:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 08:53:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-20 08:53:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:53:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 186 transitions. [2024-11-20 08:53:56,387 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 186 transitions. Word has length 168 [2024-11-20 08:53:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:53:56,388 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 186 transitions. [2024-11-20 08:53:56,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 186 transitions. [2024-11-20 08:53:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:53:56,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:53:56,390 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:56,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:53:56,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:53:56,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:53:56,390 INFO L85 PathProgramCache]: Analyzing trace with hash -351862534, now seen corresponding path program 1 times [2024-11-20 08:53:56,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:53:56,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494085379] [2024-11-20 08:53:56,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:53:56,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:53:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:53:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:53:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:53:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:53:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:53:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:53:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:53:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:53:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:53:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:53:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:53:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:53:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:53:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:53:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:53:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:53:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:53:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:53:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:53:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:53:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:53:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:53:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:53:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494085379] [2024-11-20 08:53:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494085379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:53:56,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:53:56,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:53:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502438806] [2024-11-20 08:53:56,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:53:56,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:53:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:53:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:53:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:53:56,668 INFO L87 Difference]: Start difference. First operand 127 states and 186 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:53:56,690 INFO L93 Difference]: Finished difference Result 253 states and 372 transitions. [2024-11-20 08:53:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:53:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-20 08:53:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:53:56,694 INFO L225 Difference]: With dead ends: 253 [2024-11-20 08:53:56,694 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 08:53:56,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:53:56,695 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:53:56,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:53:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 08:53:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-20 08:53:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:53:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 188 transitions. [2024-11-20 08:53:56,709 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 188 transitions. Word has length 168 [2024-11-20 08:53:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:53:56,709 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 188 transitions. [2024-11-20 08:53:56,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 188 transitions. [2024-11-20 08:53:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:53:56,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:53:56,714 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:56,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:53:56,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:53:56,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:53:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1311092550, now seen corresponding path program 1 times [2024-11-20 08:53:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:53:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381293873] [2024-11-20 08:53:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:53:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:53:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:53:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:53:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:53:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:53:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:53:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:53:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:53:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:53:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:53:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:53:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:53:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:53:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:53:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:53:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:53:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:53:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:53:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:53:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:53:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:53:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:53:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:53:57,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:53:57,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381293873] [2024-11-20 08:53:57,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381293873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:53:57,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:53:57,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:53:57,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210059824] [2024-11-20 08:53:57,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:53:57,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:53:57,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:53:57,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:53:57,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:53:57,213 INFO L87 Difference]: Start difference. First operand 129 states and 188 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:53:57,537 INFO L93 Difference]: Finished difference Result 363 states and 529 transitions. [2024-11-20 08:53:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:53:57,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-20 08:53:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:53:57,540 INFO L225 Difference]: With dead ends: 363 [2024-11-20 08:53:57,540 INFO L226 Difference]: Without dead ends: 237 [2024-11-20 08:53:57,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:53:57,542 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 134 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:53:57,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 876 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:53:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-20 08:53:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 132. [2024-11-20 08:53:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.385321100917431) internal successors, (151), 109 states have internal predecessors, (151), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:53:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2024-11-20 08:53:57,551 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 168 [2024-11-20 08:53:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:53:57,552 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2024-11-20 08:53:57,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2024-11-20 08:53:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:53:57,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:53:57,554 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:57,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:53:57,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:53:57,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:53:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1972757496, now seen corresponding path program 1 times [2024-11-20 08:53:57,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:53:57,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140668820] [2024-11-20 08:53:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:53:57,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:53:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:53:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:53:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:53:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:53:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:53:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:53:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:53:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:53:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:53:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:53:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:53:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:53:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:53:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:53:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:53:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:53:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:53:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:53:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:53:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:53:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:53:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:53:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:53:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140668820] [2024-11-20 08:53:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140668820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:53:58,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:53:58,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:53:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446546068] [2024-11-20 08:53:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:53:58,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:53:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:53:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:53:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:53:58,176 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:53:58,575 INFO L93 Difference]: Finished difference Result 262 states and 385 transitions. [2024-11-20 08:53:58,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:53:58,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-20 08:53:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:53:58,577 INFO L225 Difference]: With dead ends: 262 [2024-11-20 08:53:58,577 INFO L226 Difference]: Without dead ends: 133 [2024-11-20 08:53:58,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:53:58,578 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 164 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:53:58,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 258 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:53:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-20 08:53:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-20 08:53:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 110 states have internal predecessors, (152), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:53:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2024-11-20 08:53:58,593 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 168 [2024-11-20 08:53:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:53:58,593 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2024-11-20 08:53:58,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2024-11-20 08:53:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:53:58,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:53:58,595 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:58,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:53:58,595 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:53:58,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:53:58,599 INFO L85 PathProgramCache]: Analyzing trace with hash 692893818, now seen corresponding path program 1 times [2024-11-20 08:53:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:53:58,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756314585] [2024-11-20 08:53:58,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:53:58,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:53:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:53:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:53:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:53:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:53:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:53:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:53:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:53:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:53:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:53:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:53:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:53:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:53:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:53:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:53:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:53:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:53:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:53:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:53:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:53:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:53:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:53:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:53:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:53:59,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:53:59,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756314585] [2024-11-20 08:53:59,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756314585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:53:59,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:53:59,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:53:59,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318040437] [2024-11-20 08:53:59,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:53:59,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:53:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:53:59,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:53:59,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:53:59,255 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:53:59,665 INFO L93 Difference]: Finished difference Result 380 states and 555 transitions. [2024-11-20 08:53:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:53:59,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-20 08:53:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:53:59,667 INFO L225 Difference]: With dead ends: 380 [2024-11-20 08:53:59,667 INFO L226 Difference]: Without dead ends: 250 [2024-11-20 08:53:59,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:53:59,668 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 494 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:53:59,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 294 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:53:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-20 08:53:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 130. [2024-11-20 08:53:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:53:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 188 transitions. [2024-11-20 08:53:59,682 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 188 transitions. Word has length 168 [2024-11-20 08:53:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:53:59,682 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 188 transitions. [2024-11-20 08:53:59,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:53:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2024-11-20 08:53:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:53:59,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:53:59,685 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:59,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:53:59,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:53:59,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:53:59,685 INFO L85 PathProgramCache]: Analyzing trace with hash -353407885, now seen corresponding path program 1 times [2024-11-20 08:53:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:53:59,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119325407] [2024-11-20 08:53:59,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:53:59,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:53:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:00,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119325407] [2024-11-20 08:54:00,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119325407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:00,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:00,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:54:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009522883] [2024-11-20 08:54:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:00,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:54:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:54:00,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:54:00,219 INFO L87 Difference]: Start difference. First operand 130 states and 188 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:00,706 INFO L93 Difference]: Finished difference Result 376 states and 546 transitions. [2024-11-20 08:54:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:54:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2024-11-20 08:54:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:00,708 INFO L225 Difference]: With dead ends: 376 [2024-11-20 08:54:00,708 INFO L226 Difference]: Without dead ends: 247 [2024-11-20 08:54:00,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:54:00,709 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 423 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:00,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 396 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:54:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-20 08:54:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 130. [2024-11-20 08:54:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 107 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:54:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 185 transitions. [2024-11-20 08:54:00,718 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 185 transitions. Word has length 170 [2024-11-20 08:54:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:00,719 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 185 transitions. [2024-11-20 08:54:00,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 185 transitions. [2024-11-20 08:54:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:54:00,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:00,720 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:00,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:54:00,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:00,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1244515379, now seen corresponding path program 1 times [2024-11-20 08:54:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:00,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129796341] [2024-11-20 08:54:00,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:00,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-20 08:54:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129796341] [2024-11-20 08:54:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129796341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:54:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022803158] [2024-11-20 08:54:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:01,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:54:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:54:01,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:54:01,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:54:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:02,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-20 08:54:02,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:54:02,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2024-11-20 08:54:02,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 130 [2024-11-20 08:54:03,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-20 08:54:03,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-20 08:54:03,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-20 08:54:03,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-20 08:54:03,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-20 08:54:03,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-20 08:54:03,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 101 [2024-11-20 08:54:03,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:54:03,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 123 [2024-11-20 08:54:03,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2024-11-20 08:54:03,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:54:03,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 92 [2024-11-20 08:54:03,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 146 [2024-11-20 08:54:03,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:54:03,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 162 [2024-11-20 08:54:04,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:54:04,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 107 [2024-11-20 08:54:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-20 08:54:04,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:54:05,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-20 08:54:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-20 08:54:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022803158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:54:05,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:54:05,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 23 [2024-11-20 08:54:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620435684] [2024-11-20 08:54:05,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:54:05,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-20 08:54:05,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:05,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 08:54:05,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-11-20 08:54:05,103 INFO L87 Difference]: Start difference. First operand 130 states and 185 transitions. Second operand has 23 states, 20 states have (on average 8.3) internal successors, (166), 23 states have internal predecessors, (166), 8 states have call successors, (53), 3 states have call predecessors, (53), 6 states have return successors, (53), 5 states have call predecessors, (53), 8 states have call successors, (53) [2024-11-20 08:54:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:15,379 INFO L93 Difference]: Finished difference Result 603 states and 837 transitions. [2024-11-20 08:54:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-20 08:54:15,380 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.3) internal successors, (166), 23 states have internal predecessors, (166), 8 states have call successors, (53), 3 states have call predecessors, (53), 6 states have return successors, (53), 5 states have call predecessors, (53), 8 states have call successors, (53) Word has length 170 [2024-11-20 08:54:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:15,382 INFO L225 Difference]: With dead ends: 603 [2024-11-20 08:54:15,382 INFO L226 Difference]: Without dead ends: 476 [2024-11-20 08:54:15,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 373 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=595, Invalid=2711, Unknown=0, NotChecked=0, Total=3306 [2024-11-20 08:54:15,384 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1874 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:15,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 743 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-20 08:54:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-20 08:54:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 402. [2024-11-20 08:54:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 341 states have (on average 1.313782991202346) internal successors, (448), 343 states have internal predecessors, (448), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 08:54:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 556 transitions. [2024-11-20 08:54:15,425 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 556 transitions. Word has length 170 [2024-11-20 08:54:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:15,425 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 556 transitions. [2024-11-20 08:54:15,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.3) internal successors, (166), 23 states have internal predecessors, (166), 8 states have call successors, (53), 3 states have call predecessors, (53), 6 states have return successors, (53), 5 states have call predecessors, (53), 8 states have call successors, (53) [2024-11-20 08:54:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 556 transitions. [2024-11-20 08:54:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:54:15,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:15,427 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:15,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 08:54:15,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:54:15,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:15,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1332143155, now seen corresponding path program 1 times [2024-11-20 08:54:15,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:15,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745166856] [2024-11-20 08:54:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:15,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:17,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745166856] [2024-11-20 08:54:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745166856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:17,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 08:54:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531427506] [2024-11-20 08:54:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:17,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:54:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:54:17,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:54:17,666 INFO L87 Difference]: Start difference. First operand 402 states and 556 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-20 08:54:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:19,162 INFO L93 Difference]: Finished difference Result 1119 states and 1521 transitions. [2024-11-20 08:54:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 08:54:19,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 170 [2024-11-20 08:54:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:19,167 INFO L225 Difference]: With dead ends: 1119 [2024-11-20 08:54:19,168 INFO L226 Difference]: Without dead ends: 720 [2024-11-20 08:54:19,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:54:19,171 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 639 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:19,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 786 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 08:54:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-20 08:54:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 466. [2024-11-20 08:54:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 405 states have (on average 1.2938271604938272) internal successors, (524), 407 states have internal predecessors, (524), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 08:54:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 632 transitions. [2024-11-20 08:54:19,208 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 632 transitions. Word has length 170 [2024-11-20 08:54:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:19,209 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 632 transitions. [2024-11-20 08:54:19,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-20 08:54:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 632 transitions. [2024-11-20 08:54:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:54:19,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:19,213 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:19,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 08:54:19,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:19,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1550997873, now seen corresponding path program 1 times [2024-11-20 08:54:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391203127] [2024-11-20 08:54:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:19,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:19,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391203127] [2024-11-20 08:54:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391203127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:19,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:19,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:54:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560217416] [2024-11-20 08:54:19,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:19,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:54:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:19,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:54:19,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:54:19,331 INFO L87 Difference]: Start difference. First operand 466 states and 632 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:19,364 INFO L93 Difference]: Finished difference Result 940 states and 1280 transitions. [2024-11-20 08:54:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:54:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2024-11-20 08:54:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:19,368 INFO L225 Difference]: With dead ends: 940 [2024-11-20 08:54:19,368 INFO L226 Difference]: Without dead ends: 477 [2024-11-20 08:54:19,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:54:19,369 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:19,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:54:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-20 08:54:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-11-20 08:54:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 416 states have (on average 1.2860576923076923) internal successors, (535), 418 states have internal predecessors, (535), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 08:54:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 643 transitions. [2024-11-20 08:54:19,396 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 643 transitions. Word has length 170 [2024-11-20 08:54:19,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:19,396 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 643 transitions. [2024-11-20 08:54:19,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 643 transitions. [2024-11-20 08:54:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:54:19,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:19,398 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:19,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:54:19,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:19,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:19,399 INFO L85 PathProgramCache]: Analyzing trace with hash -400040147, now seen corresponding path program 1 times [2024-11-20 08:54:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:19,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900577257] [2024-11-20 08:54:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900577257] [2024-11-20 08:54:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900577257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:20,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:20,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:54:20,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922544198] [2024-11-20 08:54:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:20,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:54:20,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:54:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:54:20,997 INFO L87 Difference]: Start difference. First operand 477 states and 643 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:21,667 INFO L93 Difference]: Finished difference Result 1056 states and 1415 transitions. [2024-11-20 08:54:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:54:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 171 [2024-11-20 08:54:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:21,670 INFO L225 Difference]: With dead ends: 1056 [2024-11-20 08:54:21,670 INFO L226 Difference]: Without dead ends: 582 [2024-11-20 08:54:21,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:54:21,671 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 237 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:21,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 877 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:54:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-20 08:54:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 449. [2024-11-20 08:54:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 388 states have (on average 1.288659793814433) internal successors, (500), 390 states have internal predecessors, (500), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 08:54:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 608 transitions. [2024-11-20 08:54:21,694 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 608 transitions. Word has length 171 [2024-11-20 08:54:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:21,695 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 608 transitions. [2024-11-20 08:54:21,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 608 transitions. [2024-11-20 08:54:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 08:54:21,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:21,697 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:21,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 08:54:21,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:21,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash -130573131, now seen corresponding path program 1 times [2024-11-20 08:54:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:21,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462845511] [2024-11-20 08:54:21,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:21,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462845511] [2024-11-20 08:54:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462845511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:21,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:54:21,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890454086] [2024-11-20 08:54:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:21,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:54:21,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:21,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:54:21,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:54:21,928 INFO L87 Difference]: Start difference. First operand 449 states and 608 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:22,193 INFO L93 Difference]: Finished difference Result 1238 states and 1683 transitions. [2024-11-20 08:54:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:54:22,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-11-20 08:54:22,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:22,197 INFO L225 Difference]: With dead ends: 1238 [2024-11-20 08:54:22,197 INFO L226 Difference]: Without dead ends: 792 [2024-11-20 08:54:22,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:54:22,198 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 158 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:22,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 470 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:54:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-11-20 08:54:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 541. [2024-11-20 08:54:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 456 states have (on average 1.2719298245614035) internal successors, (580), 459 states have internal predecessors, (580), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-20 08:54:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 730 transitions. [2024-11-20 08:54:22,232 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 730 transitions. Word has length 172 [2024-11-20 08:54:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:22,232 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 730 transitions. [2024-11-20 08:54:22,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 730 transitions. [2024-11-20 08:54:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 08:54:22,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:22,233 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:22,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 08:54:22,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:22,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash -42945355, now seen corresponding path program 1 times [2024-11-20 08:54:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:22,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218211482] [2024-11-20 08:54:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:23,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:23,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218211482] [2024-11-20 08:54:23,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218211482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:23,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:23,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:54:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491103906] [2024-11-20 08:54:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:23,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:54:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:23,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:54:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:54:23,878 INFO L87 Difference]: Start difference. First operand 541 states and 730 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:24,230 INFO L93 Difference]: Finished difference Result 1009 states and 1357 transitions. [2024-11-20 08:54:24,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:54:24,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2024-11-20 08:54:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:24,237 INFO L225 Difference]: With dead ends: 1009 [2024-11-20 08:54:24,237 INFO L226 Difference]: Without dead ends: 548 [2024-11-20 08:54:24,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:54:24,238 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 77 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:24,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 694 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:54:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-20 08:54:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 503. [2024-11-20 08:54:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 418 states have (on average 1.284688995215311) internal successors, (537), 421 states have internal predecessors, (537), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-20 08:54:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 687 transitions. [2024-11-20 08:54:24,290 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 687 transitions. Word has length 172 [2024-11-20 08:54:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:24,291 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 687 transitions. [2024-11-20 08:54:24,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 687 transitions. [2024-11-20 08:54:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 08:54:24,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:24,292 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:24,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 08:54:24,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:24,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2076672266, now seen corresponding path program 1 times [2024-11-20 08:54:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084446880] [2024-11-20 08:54:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:24,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:25,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:25,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084446880] [2024-11-20 08:54:25,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084446880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:25,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:54:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449208756] [2024-11-20 08:54:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:25,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:54:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:54:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:54:25,401 INFO L87 Difference]: Start difference. First operand 503 states and 687 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:25,882 INFO L93 Difference]: Finished difference Result 942 states and 1279 transitions. [2024-11-20 08:54:25,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:54:25,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 175 [2024-11-20 08:54:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:25,884 INFO L225 Difference]: With dead ends: 942 [2024-11-20 08:54:25,884 INFO L226 Difference]: Without dead ends: 519 [2024-11-20 08:54:25,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:54:25,889 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 115 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:25,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 835 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:54:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-20 08:54:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 465. [2024-11-20 08:54:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 391 states have (on average 1.2736572890025575) internal successors, (498), 394 states have internal predecessors, (498), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 08:54:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 626 transitions. [2024-11-20 08:54:25,920 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 626 transitions. Word has length 175 [2024-11-20 08:54:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:25,920 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 626 transitions. [2024-11-20 08:54:25,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 626 transitions. [2024-11-20 08:54:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 08:54:25,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:25,921 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:25,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 08:54:25,922 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:25,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:25,922 INFO L85 PathProgramCache]: Analyzing trace with hash 754401480, now seen corresponding path program 1 times [2024-11-20 08:54:25,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:25,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119206373] [2024-11-20 08:54:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:25,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:27,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:27,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119206373] [2024-11-20 08:54:27,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119206373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:27,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 08:54:27,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828614943] [2024-11-20 08:54:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:27,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 08:54:27,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 08:54:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:54:27,466 INFO L87 Difference]: Start difference. First operand 465 states and 626 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:29,393 INFO L93 Difference]: Finished difference Result 1044 states and 1370 transitions. [2024-11-20 08:54:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 08:54:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-20 08:54:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:29,397 INFO L225 Difference]: With dead ends: 1044 [2024-11-20 08:54:29,397 INFO L226 Difference]: Without dead ends: 1042 [2024-11-20 08:54:29,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 08:54:29,398 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1115 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:29,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 819 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 08:54:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-20 08:54:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 749. [2024-11-20 08:54:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 632 states have (on average 1.2610759493670887) internal successors, (797), 637 states have internal predecessors, (797), 99 states have call successors, (99), 17 states have call predecessors, (99), 17 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-20 08:54:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 995 transitions. [2024-11-20 08:54:29,508 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 995 transitions. Word has length 177 [2024-11-20 08:54:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:29,512 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 995 transitions. [2024-11-20 08:54:29,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 995 transitions. [2024-11-20 08:54:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 08:54:29,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:29,513 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:29,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 08:54:29,514 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:29,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1488434106, now seen corresponding path program 1 times [2024-11-20 08:54:29,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:29,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583379559] [2024-11-20 08:54:29,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:30,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:30,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583379559] [2024-11-20 08:54:30,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583379559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:30,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:30,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:54:30,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20365836] [2024-11-20 08:54:30,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:30,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:54:30,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:30,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:54:30,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:54:30,508 INFO L87 Difference]: Start difference. First operand 749 states and 995 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:30,830 INFO L93 Difference]: Finished difference Result 1484 states and 1968 transitions. [2024-11-20 08:54:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:54:30,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-20 08:54:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:30,833 INFO L225 Difference]: With dead ends: 1484 [2024-11-20 08:54:30,833 INFO L226 Difference]: Without dead ends: 771 [2024-11-20 08:54:30,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:54:30,835 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 46 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:30,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 589 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:54:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-20 08:54:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 769. [2024-11-20 08:54:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 648 states have (on average 1.2546296296296295) internal successors, (813), 653 states have internal predecessors, (813), 99 states have call successors, (99), 21 states have call predecessors, (99), 21 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-20 08:54:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1011 transitions. [2024-11-20 08:54:30,886 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1011 transitions. Word has length 177 [2024-11-20 08:54:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:30,886 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1011 transitions. [2024-11-20 08:54:30,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1011 transitions. [2024-11-20 08:54:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 08:54:30,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:30,887 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:30,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 08:54:30,887 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:30,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash -787369528, now seen corresponding path program 1 times [2024-11-20 08:54:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:30,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249196166] [2024-11-20 08:54:30,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:32,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249196166] [2024-11-20 08:54:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249196166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:32,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:54:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915571102] [2024-11-20 08:54:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:32,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:54:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:32,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:54:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:54:32,011 INFO L87 Difference]: Start difference. First operand 769 states and 1011 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:32,706 INFO L93 Difference]: Finished difference Result 1692 states and 2224 transitions. [2024-11-20 08:54:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:54:32,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-20 08:54:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:32,711 INFO L225 Difference]: With dead ends: 1692 [2024-11-20 08:54:32,712 INFO L226 Difference]: Without dead ends: 963 [2024-11-20 08:54:32,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:54:32,714 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 46 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:32,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 821 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:54:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-20 08:54:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 881. [2024-11-20 08:54:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 760 states have (on average 1.236842105263158) internal successors, (940), 765 states have internal predecessors, (940), 99 states have call successors, (99), 21 states have call predecessors, (99), 21 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-20 08:54:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1138 transitions. [2024-11-20 08:54:32,775 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1138 transitions. Word has length 177 [2024-11-20 08:54:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:32,775 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1138 transitions. [2024-11-20 08:54:32,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1138 transitions. [2024-11-20 08:54:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 08:54:32,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:32,776 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:32,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 08:54:32,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:32,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash 167595466, now seen corresponding path program 1 times [2024-11-20 08:54:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550078085] [2024-11-20 08:54:32,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:32,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550078085] [2024-11-20 08:54:32,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550078085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:32,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:32,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:54:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453470363] [2024-11-20 08:54:32,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:32,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:54:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:32,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:54:32,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:54:32,900 INFO L87 Difference]: Start difference. First operand 881 states and 1138 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:32,990 INFO L93 Difference]: Finished difference Result 1725 states and 2238 transitions. [2024-11-20 08:54:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:54:32,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 177 [2024-11-20 08:54:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:32,994 INFO L225 Difference]: With dead ends: 1725 [2024-11-20 08:54:32,994 INFO L226 Difference]: Without dead ends: 884 [2024-11-20 08:54:32,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:54:32,996 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:32,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 527 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:54:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-11-20 08:54:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2024-11-20 08:54:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 763 states have (on average 1.2254259501965925) internal successors, (935), 768 states have internal predecessors, (935), 99 states have call successors, (99), 21 states have call predecessors, (99), 21 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-20 08:54:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1133 transitions. [2024-11-20 08:54:33,053 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1133 transitions. Word has length 177 [2024-11-20 08:54:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:33,053 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1133 transitions. [2024-11-20 08:54:33,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1133 transitions. [2024-11-20 08:54:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 08:54:33,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:33,055 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:33,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 08:54:33,055 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:33,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:33,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1374175542, now seen corresponding path program 1 times [2024-11-20 08:54:33,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:33,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043540454] [2024-11-20 08:54:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:33,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043540454] [2024-11-20 08:54:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043540454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:34,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:54:34,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214527264] [2024-11-20 08:54:34,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:34,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:54:34,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:34,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:54:34,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:54:34,057 INFO L87 Difference]: Start difference. First operand 884 states and 1133 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-20 08:54:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:35,517 INFO L93 Difference]: Finished difference Result 2087 states and 2699 transitions. [2024-11-20 08:54:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 08:54:35,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 177 [2024-11-20 08:54:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:35,522 INFO L225 Difference]: With dead ends: 2087 [2024-11-20 08:54:35,522 INFO L226 Difference]: Without dead ends: 1243 [2024-11-20 08:54:35,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:54:35,524 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 731 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:35,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 720 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 08:54:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-20 08:54:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 804. [2024-11-20 08:54:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 716 states have (on average 1.223463687150838) internal successors, (876), 718 states have internal predecessors, (876), 73 states have call successors, (73), 14 states have call predecessors, (73), 14 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-20 08:54:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1022 transitions. [2024-11-20 08:54:35,565 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1022 transitions. Word has length 177 [2024-11-20 08:54:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:35,565 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1022 transitions. [2024-11-20 08:54:35,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-20 08:54:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1022 transitions. [2024-11-20 08:54:35,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 08:54:35,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:35,567 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:35,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 08:54:35,567 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:35,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:35,567 INFO L85 PathProgramCache]: Analyzing trace with hash 871614276, now seen corresponding path program 1 times [2024-11-20 08:54:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:35,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425211582] [2024-11-20 08:54:35,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:35,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425211582] [2024-11-20 08:54:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425211582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:36,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:36,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:54:36,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851981414] [2024-11-20 08:54:36,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:36,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:54:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:36,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:54:36,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:54:36,446 INFO L87 Difference]: Start difference. First operand 804 states and 1022 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:36,812 INFO L93 Difference]: Finished difference Result 1682 states and 2141 transitions. [2024-11-20 08:54:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:54:36,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-20 08:54:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:36,817 INFO L225 Difference]: With dead ends: 1682 [2024-11-20 08:54:36,817 INFO L226 Difference]: Without dead ends: 881 [2024-11-20 08:54:36,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:54:36,819 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 88 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:36,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 625 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:54:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-20 08:54:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 875. [2024-11-20 08:54:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 781 states have (on average 1.229193341869398) internal successors, (960), 785 states have internal predecessors, (960), 77 states have call successors, (77), 16 states have call predecessors, (77), 16 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-20 08:54:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1114 transitions. [2024-11-20 08:54:36,889 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1114 transitions. Word has length 177 [2024-11-20 08:54:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:36,890 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1114 transitions. [2024-11-20 08:54:36,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1114 transitions. [2024-11-20 08:54:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 08:54:36,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:36,891 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 08:54:36,892 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:36,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1500124986, now seen corresponding path program 1 times [2024-11-20 08:54:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:36,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605831552] [2024-11-20 08:54:36,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:38,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605831552] [2024-11-20 08:54:38,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605831552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:38,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:38,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:54:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587329519] [2024-11-20 08:54:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:38,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:54:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:38,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:54:38,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:54:38,023 INFO L87 Difference]: Start difference. First operand 875 states and 1114 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:38,440 INFO L93 Difference]: Finished difference Result 1884 states and 2395 transitions. [2024-11-20 08:54:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:54:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-20 08:54:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:38,444 INFO L225 Difference]: With dead ends: 1884 [2024-11-20 08:54:38,444 INFO L226 Difference]: Without dead ends: 1012 [2024-11-20 08:54:38,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:54:38,446 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 124 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:38,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 889 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:54:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-20 08:54:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 945. [2024-11-20 08:54:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 851 states have (on average 1.2244418331374853) internal successors, (1042), 855 states have internal predecessors, (1042), 77 states have call successors, (77), 16 states have call predecessors, (77), 16 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-20 08:54:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1196 transitions. [2024-11-20 08:54:38,491 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1196 transitions. Word has length 177 [2024-11-20 08:54:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:38,491 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1196 transitions. [2024-11-20 08:54:38,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1196 transitions. [2024-11-20 08:54:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 08:54:38,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:38,492 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:38,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 08:54:38,493 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:38,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:38,493 INFO L85 PathProgramCache]: Analyzing trace with hash -113921592, now seen corresponding path program 1 times [2024-11-20 08:54:38,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:38,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703170658] [2024-11-20 08:54:38,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:38,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:54:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:54:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:54:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:54:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:54:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:54:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:54:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:54:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:54:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:54:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:54:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:54:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:54:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:54:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:54:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:54:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:54:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:54:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:54:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:54:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 08:54:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:54:39,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703170658] [2024-11-20 08:54:39,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703170658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:39,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:39,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:54:39,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647976262] [2024-11-20 08:54:39,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:39,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:54:39,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:54:39,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:54:39,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:54:39,383 INFO L87 Difference]: Start difference. First operand 945 states and 1196 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:40,469 INFO L93 Difference]: Finished difference Result 2319 states and 2960 transitions. [2024-11-20 08:54:40,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:54:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 177 [2024-11-20 08:54:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:40,475 INFO L225 Difference]: With dead ends: 2319 [2024-11-20 08:54:40,475 INFO L226 Difference]: Without dead ends: 1377 [2024-11-20 08:54:40,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:54:40,477 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 716 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:40,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 502 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:54:40,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2024-11-20 08:54:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 942. [2024-11-20 08:54:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 848 states have (on average 1.221698113207547) internal successors, (1036), 852 states have internal predecessors, (1036), 77 states have call successors, (77), 16 states have call predecessors, (77), 16 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-20 08:54:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1190 transitions. [2024-11-20 08:54:40,531 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1190 transitions. Word has length 177 [2024-11-20 08:54:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:40,531 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1190 transitions. [2024-11-20 08:54:40,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1190 transitions. [2024-11-20 08:54:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 08:54:40,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:40,532 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:40,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 08:54:40,533 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:40,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1813063538, now seen corresponding path program 1 times [2024-11-20 08:54:40,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:54:40,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702970739] [2024-11-20 08:54:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:54:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:54:40,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:54:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:54:40,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:54:40,718 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:54:40,719 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:54:40,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 08:54:40,722 INFO L407 BasicCegarLoop]: Path program histogram: [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 08:54:40,794 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:54:40,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:54:40 BoogieIcfgContainer [2024-11-20 08:54:40,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:54:40,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:54:40,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:54:40,797 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:54:40,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:53:55" (3/4) ... [2024-11-20 08:54:40,801 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:54:40,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:54:40,803 INFO L158 Benchmark]: Toolchain (without parser) took 47108.96ms. Allocated memory was 159.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 87.0MB in the beginning and 886.6MB in the end (delta: -799.6MB). Peak memory consumption was 498.5MB. Max. memory is 16.1GB. [2024-11-20 08:54:40,803 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:54:40,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.69ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 86.8MB in the beginning and 188.1MB in the end (delta: -101.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-11-20 08:54:40,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.59ms. Allocated memory is still 218.1MB. Free memory was 188.1MB in the beginning and 182.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:54:40,805 INFO L158 Benchmark]: Boogie Preprocessor took 70.32ms. Allocated memory is still 218.1MB. Free memory was 182.9MB in the beginning and 178.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:54:40,805 INFO L158 Benchmark]: RCFGBuilder took 773.31ms. Allocated memory is still 218.1MB. Free memory was 178.7MB in the beginning and 138.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-20 08:54:40,805 INFO L158 Benchmark]: TraceAbstraction took 45784.27ms. Allocated memory was 218.1MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 138.9MB in the beginning and 887.6MB in the end (delta: -748.8MB). Peak memory consumption was 489.6MB. Max. memory is 16.1GB. [2024-11-20 08:54:40,805 INFO L158 Benchmark]: Witness Printer took 5.06ms. Allocated memory is still 1.5GB. Free memory was 887.6MB in the beginning and 886.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:54:40,806 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.69ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 86.8MB in the beginning and 188.1MB in the end (delta: -101.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.59ms. Allocated memory is still 218.1MB. Free memory was 188.1MB in the beginning and 182.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.32ms. Allocated memory is still 218.1MB. Free memory was 182.9MB in the beginning and 178.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 773.31ms. Allocated memory is still 218.1MB. Free memory was 178.7MB in the beginning and 138.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45784.27ms. Allocated memory was 218.1MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 138.9MB in the beginning and 887.6MB in the end (delta: -748.8MB). Peak memory consumption was 489.6MB. Max. memory is 16.1GB. * Witness Printer took 5.06ms. Allocated memory is still 1.5GB. Free memory was 887.6MB in the beginning and 886.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 69. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 1000000, 0, 1, -64, -64, 10, 8, 0, 1, 0, 2, 32.25, 15.5, 256.25, 8.6, 57581 }; [L59] unsigned char last_1_WrapperStruct00_var_1_9 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_9=0] [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L123] EXPR WrapperStruct00.var_1_9 [L123] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L91] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L97] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L103] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L106] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L114] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_15 [L115] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_15 [L115] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L116] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L117] EXPR WrapperStruct00.var_1_16 [L117] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_16 [L117] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L118] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L134] RET updateVariables() [L135] CALL step() [L63] COND FALSE !(\read(last_1_WrapperStruct00_var_1_9)) [L66] EXPR WrapperStruct00.var_1_7 [L66] EXPR WrapperStruct00.var_1_8 [L66] WrapperStruct00.var_1_5 = ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8) [L68] EXPR WrapperStruct00.var_1_13 [L68] EXPR WrapperStruct00.var_1_14 [L68] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L68] COND TRUE (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15 [L69] EXPR WrapperStruct00.var_1_16 [L69] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L69] COND TRUE (WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14 [L70] EXPR WrapperStruct00.var_1_17 [L70] EXPR WrapperStruct00.var_1_7 [L70] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7) [L77] EXPR WrapperStruct00.var_1_5 [L77] EXPR WrapperStruct00.var_1_12 [L77] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 [L77] EXPR WrapperStruct00.var_1_2 [L77] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L77] ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 [L77] EXPR WrapperStruct00.var_1_3 [L77] ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L77] COND TRUE ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 [L78] EXPR WrapperStruct00.var_1_10 [L78] WrapperStruct00.var_1_9 = (! WrapperStruct00.var_1_10) [L82] EXPR WrapperStruct00.var_1_9 [L82] unsigned char stepLocal_0 = WrapperStruct00.var_1_9; [L83] stepLocal_0 && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L83] COND FALSE !(stepLocal_0 && WrapperStruct00.var_1_9) [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR WrapperStruct00.var_1_9 [L126] EXPR WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))) [L126] EXPR WrapperStruct00.var_1_5 [L126] EXPR WrapperStruct00.var_1_7 [L126] EXPR WrapperStruct00.var_1_8 [L126] EXPR last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10))))) [L126] EXPR WrapperStruct00.var_1_5 [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 [L126] EXPR WrapperStruct00.var_1_2 [L126] EXPR (WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 [L126] EXPR WrapperStruct00.var_1_3 [L126] EXPR ((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))) [L126] EXPR WrapperStruct00.var_1_9 [L126] EXPR WrapperStruct00.var_1_10 [L126] EXPR (((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR (((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8))) [L126] EXPR WrapperStruct00.var_1_13 [L126] EXPR WrapperStruct00.var_1_14 [L126] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8)) [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR WrapperStruct00.var_1_8 [L126] EXPR ((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126] EXPR ((((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L126-L127] return ((((WrapperStruct00.var_1_9 && WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_5)) : 1) && (last_1_WrapperStruct00_var_1_9 ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_5 == ((signed short int) ((WrapperStruct00.var_1_7 + 16) - WrapperStruct00.var_1_8))))) && ((((WrapperStruct00.var_1_5 >= WrapperStruct00.var_1_12) && WrapperStruct00.var_1_2) && WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_9 == ((unsigned char) (! WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_9 == ((unsigned char) (! (WrapperStruct00.var_1_11 || WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_14) <= WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_16 - 2.3) > WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_7) > (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_7) : (((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_8))))))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_8))) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.7s, OverallIterations: 24, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7207 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7182 mSDsluCounter, 13857 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10195 mSDsCounter, 1926 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10102 IncrementalHoareTripleChecker+Invalid, 12028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1926 mSolverCounterUnsat, 3662 mSDtfsCounter, 10102 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1743 GetRequests, 1510 SyntacticMatches, 3 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=945occurred in iteration=22, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 2477 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 4310 NumberOfCodeBlocks, 4310 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4277 ConstructedInterpolants, 0 QuantifiedInterpolants, 19239 SizeOfPredicates, 6 NumberOfNonLiveVariables, 599 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 20910/21000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:54:40,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_variablewrapping_wrapper-s_file-14.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:54:42,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:54:43,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:54:43,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:54:43,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:54:43,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:54:43,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:54:43,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:54:43,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:54:43,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:54:43,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:54:43,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:54:43,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:54:43,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:54:43,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:54:43,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:54:43,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:54:43,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:54:43,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:54:43,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:54:43,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:54:43,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:54:43,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:54:43,075 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:54:43,075 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:54:43,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:54:43,076 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:54:43,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:54:43,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:54:43,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:54:43,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:54:43,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:54:43,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:54:43,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:54:43,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:54:43,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:54:43,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:54:43,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:54:43,079 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:54:43,079 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:54:43,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:54:43,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:54:43,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:54:43,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:54:43,080 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 -> 03015dc15296b27011ea4abd50b336e0db146e7d4accd33e7d5903aad3a9693d [2024-11-20 08:54:43,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:54:43,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:54:43,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:54:43,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:54:43,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:54:43,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2024-11-20 08:54:44,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:54:44,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:54:44,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-14.i [2024-11-20 08:54:44,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349c6648a/48da6a0760564247b0e5cbb4b2f82ba6/FLAG8a32c3c0f [2024-11-20 08:54:45,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/349c6648a/48da6a0760564247b0e5cbb4b2f82ba6 [2024-11-20 08:54:45,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:54:45,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:54:45,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:54:45,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:54:45,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:54:45,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e383680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45, skipping insertion in model container [2024-11-20 08:54:45,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:54:45,163 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_variablewrapping_wrapper-s_file-14.i[916,929] [2024-11-20 08:54:45,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:54:45,246 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:54:45,258 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_variablewrapping_wrapper-s_file-14.i[916,929] [2024-11-20 08:54:45,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:54:45,338 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:54:45,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45 WrapperNode [2024-11-20 08:54:45,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:54:45,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:54:45,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:54:45,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:54:45,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,413 INFO L138 Inliner]: procedures = 40, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 557 [2024-11-20 08:54:45,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:54:45,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:54:45,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:54:45,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:54:45,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,465 INFO L175 MemorySlicer]: Split 151 memory accesses to 2 slices as follows [2, 149]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 37 writes are split as follows [0, 37]. [2024-11-20 08:54:45,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:54:45,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:54:45,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:54:45,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:54:45,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (1/1) ... [2024-11-20 08:54:45,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:54:45,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:54:45,550 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 08:54:45,595 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 08:54:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:54:45,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-20 08:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-20 08:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-20 08:54:45,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-20 08:54:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-20 08:54:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-20 08:54:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:54:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:54:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:54:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:54:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 08:54:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 08:54:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 08:54:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 08:54:45,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 08:54:45,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 08:54:45,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-20 08:54:45,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-20 08:54:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 08:54:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 08:54:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-20 08:54:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-20 08:54:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-20 08:54:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-20 08:54:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:54:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:54:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-20 08:54:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-20 08:54:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:54:45,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:54:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:54:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:54:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 08:54:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 08:54:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 08:54:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 08:54:45,800 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:54:45,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:54:50,171 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-20 08:54:50,171 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:54:50,189 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:54:50,190 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:54:50,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:50 BoogieIcfgContainer [2024-11-20 08:54:50,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:54:50,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:54:50,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:54:50,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:54:50,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:54:45" (1/3) ... [2024-11-20 08:54:50,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2aad30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:54:50, skipping insertion in model container [2024-11-20 08:54:50,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:45" (2/3) ... [2024-11-20 08:54:50,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2aad30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:54:50, skipping insertion in model container [2024-11-20 08:54:50,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:50" (3/3) ... [2024-11-20 08:54:50,200 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-14.i [2024-11-20 08:54:50,212 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:54:50,213 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:54:50,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:54:50,277 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;@78df870b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:54:50,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:54:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:54:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:54:50,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:50,296 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:50,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash -822542588, now seen corresponding path program 1 times [2024-11-20 08:54:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:54:50,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100395419] [2024-11-20 08:54:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:50,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:54:50,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:54:50,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:54:50,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:54:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:50,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:54:50,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:54:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-20 08:54:50,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:54:50,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:54:50,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100395419] [2024-11-20 08:54:50,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100395419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:50,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:50,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:54:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874044629] [2024-11-20 08:54:50,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:50,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:54:50,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:54:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:54:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:54:50,827 INFO L87 Difference]: Start difference. First operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:50,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:50,851 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2024-11-20 08:54:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:54:50,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-20 08:54:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:50,858 INFO L225 Difference]: With dead ends: 249 [2024-11-20 08:54:50,858 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 08:54:50,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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 08:54:50,864 INFO L432 NwaCegarLoop]: 183 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, 183 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 08:54:50,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:54:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 08:54:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-20 08:54:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:54:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2024-11-20 08:54:50,897 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2024-11-20 08:54:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:50,898 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2024-11-20 08:54:50,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:54:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2024-11-20 08:54:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:54:50,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:50,901 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:50,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 08:54:51,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:54:51,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:51,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1885402662, now seen corresponding path program 1 times [2024-11-20 08:54:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:54:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430683535] [2024-11-20 08:54:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:51,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:54:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:54:51,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:54:51,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 08:54:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:51,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:54:51,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:54:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:51,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:54:51,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:54:51,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430683535] [2024-11-20 08:54:51,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430683535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:51,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:51,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:54:51,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144115115] [2024-11-20 08:54:51,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:51,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:54:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:54:51,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:54:51,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:54:51,553 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:51,609 INFO L93 Difference]: Finished difference Result 248 states and 368 transitions. [2024-11-20 08:54:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:54:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-20 08:54:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:51,611 INFO L225 Difference]: With dead ends: 248 [2024-11-20 08:54:51,611 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 08:54:51,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:54:51,613 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:51,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 530 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:54:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 08:54:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-20 08:54:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:54:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 186 transitions. [2024-11-20 08:54:51,625 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 186 transitions. Word has length 168 [2024-11-20 08:54:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:51,629 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 186 transitions. [2024-11-20 08:54:51,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 186 transitions. [2024-11-20 08:54:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:54:51,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:51,633 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:51,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 08:54:51,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:54:51,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:51,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1591916184, now seen corresponding path program 1 times [2024-11-20 08:54:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:54:51,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182258344] [2024-11-20 08:54:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:51,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:54:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:54:51,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:54:51,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 08:54:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:52,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 08:54:52,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:54:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:54:52,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:54:52,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:54:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182258344] [2024-11-20 08:54:52,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182258344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:52,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:52,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:54:52,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925027128] [2024-11-20 08:54:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:54:52,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:54:52,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:54:52,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:54:52,239 INFO L87 Difference]: Start difference. First operand 127 states and 186 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:54:56,597 INFO L93 Difference]: Finished difference Result 252 states and 371 transitions. [2024-11-20 08:54:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:54:56,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-20 08:54:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:54:56,603 INFO L225 Difference]: With dead ends: 252 [2024-11-20 08:54:56,604 INFO L226 Difference]: Without dead ends: 128 [2024-11-20 08:54:56,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:54:56,609 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:54:56,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-20 08:54:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-20 08:54:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-20 08:54:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:54:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 187 transitions. [2024-11-20 08:54:56,628 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 187 transitions. Word has length 168 [2024-11-20 08:54:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:54:56,628 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 187 transitions. [2024-11-20 08:54:56,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:54:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 187 transitions. [2024-11-20 08:54:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 08:54:56,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:54:56,635 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:56,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 08:54:56,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:54:56,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:54:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:54:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash -580798934, now seen corresponding path program 1 times [2024-11-20 08:54:56,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:54:56,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892615630] [2024-11-20 08:54:56,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:54:56,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:54:56,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:54:56,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:54:56,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 08:54:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:54:57,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:54:57,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:54:57,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:54:57,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-20 08:54:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-20 08:54:57,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:54:57,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:54:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892615630] [2024-11-20 08:54:57,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892615630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:54:57,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:54:57,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:54:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065944208] [2024-11-20 08:54:57,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:54:57,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:54:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:54:57,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:54:57,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:54:57,613 INFO L87 Difference]: Start difference. First operand 128 states and 187 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:55:00,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:55:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:55:03,433 INFO L93 Difference]: Finished difference Result 254 states and 372 transitions. [2024-11-20 08:55:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:55:03,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-20 08:55:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:55:03,443 INFO L225 Difference]: With dead ends: 254 [2024-11-20 08:55:03,443 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 08:55:03,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:55:03,451 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 111 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:55:03,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 517 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-20 08:55:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 08:55:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-20 08:55:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:55:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-20 08:55:03,472 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 168 [2024-11-20 08:55:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:55:03,476 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-20 08:55:03,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:55:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-20 08:55:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:55:03,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:55:03,480 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:03,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 08:55:03,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:55:03,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:55:03,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:55:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash -515450012, now seen corresponding path program 1 times [2024-11-20 08:55:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:55:03,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243778597] [2024-11-20 08:55:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:55:03,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:55:03,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:55:03,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:55:03,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 08:55:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:55:04,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 08:55:04,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:55:04,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 93 [2024-11-20 08:55:04,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 150 [2024-11-20 08:55:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:55:04,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:55:04,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:55:04,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243778597] [2024-11-20 08:55:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243778597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:55:04,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:55:04,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:55:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167692039] [2024-11-20 08:55:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:55:04,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:55:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:55:04,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:55:04,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:55:04,640 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:55:09,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:55:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:55:11,339 INFO L93 Difference]: Finished difference Result 383 states and 556 transitions. [2024-11-20 08:55:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:55:11,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2024-11-20 08:55:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:55:11,342 INFO L225 Difference]: With dead ends: 383 [2024-11-20 08:55:11,342 INFO L226 Difference]: Without dead ends: 258 [2024-11-20 08:55:11,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:55:11,344 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 104 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:55:11,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 443 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-20 08:55:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-20 08:55:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 230. [2024-11-20 08:55:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.3478260869565217) internal successors, (248), 184 states have internal predecessors, (248), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:55:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2024-11-20 08:55:11,378 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 170 [2024-11-20 08:55:11,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:55:11,379 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2024-11-20 08:55:11,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:55:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2024-11-20 08:55:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:55:11,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:55:11,380 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:11,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 08:55:11,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:55:11,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:55:11,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:55:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash -649463518, now seen corresponding path program 1 times [2024-11-20 08:55:11,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:55:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049925194] [2024-11-20 08:55:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:55:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:55:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:55:11,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:55:11,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 08:55:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:55:12,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 08:55:12,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:55:12,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 08:55:12,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-20 08:55:12,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:55:12,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2024-11-20 08:55:12,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:55:12,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2024-11-20 08:55:13,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:55:13,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2024-11-20 08:55:13,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:55:13,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53