./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-88.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-88.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 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:02:01,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:02:01,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:02:02,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:02:02,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:02:02,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:02:02,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:02:02,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:02:02,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:02:02,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:02:02,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:02:02,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:02:02,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:02:02,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:02:02,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:02:02,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:02:02,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:02:02,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:02:02,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:02:02,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:02:02,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:02:02,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:02:02,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:02:02,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:02:02,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:02:02,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:02:02,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:02:02,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:02:02,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:02:02,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:02:02,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:02:02,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:02:02,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:02:02,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:02:02,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:02:02,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:02:02,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:02:02,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:02:02,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:02:02,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:02:02,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:02:02,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:02:02,045 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 -> 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd [2024-11-20 09:02:02,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:02:02,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:02:02,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:02:02,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:02:02,296 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:02:02,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-11-20 09:02:03,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:02:03,821 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:02:03,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-11-20 09:02:03,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68626b65/2f575b17f9674c4e80979ec5802d68d4/FLAGa5235b5b7 [2024-11-20 09:02:03,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68626b65/2f575b17f9674c4e80979ec5802d68d4 [2024-11-20 09:02:03,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:02:03,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:02:03,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:02:03,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:02:03,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:02:03,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:02:03" (1/1) ... [2024-11-20 09:02:03,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd6c949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:03, skipping insertion in model container [2024-11-20 09:02:03,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:02:03" (1/1) ... [2024-11-20 09:02:03,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:02:04,038 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-88.i[916,929] [2024-11-20 09:02:04,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:02:04,166 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:02:04,197 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-88.i[916,929] [2024-11-20 09:02:04,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:02:04,269 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:02:04,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04 WrapperNode [2024-11-20 09:02:04,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:02:04,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:02:04,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:02:04,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:02:04,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,348 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2024-11-20 09:02:04,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:02:04,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:02:04,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:02:04,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:02:04,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,376 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 09:02:04,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:02:04,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:02:04,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:02:04,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:02:04,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (1/1) ... [2024-11-20 09:02:04,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:02:04,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:04,470 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 09:02:04,474 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 09:02:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:02:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 09:02:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 09:02:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 09:02:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 09:02:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 09:02:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 09:02:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:02:04,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:02:04,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 09:02:04,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:02:04,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:02:04,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:02:04,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:02:05,238 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-20 09:02:05,239 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:02:05,249 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:02:05,249 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:02:05,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:02:05 BoogieIcfgContainer [2024-11-20 09:02:05,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:02:05,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:02:05,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:02:05,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:02:05,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:02:03" (1/3) ... [2024-11-20 09:02:05,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62feb479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:02:05, skipping insertion in model container [2024-11-20 09:02:05,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:04" (2/3) ... [2024-11-20 09:02:05,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62feb479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:02:05, skipping insertion in model container [2024-11-20 09:02:05,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:02:05" (3/3) ... [2024-11-20 09:02:05,255 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-88.i [2024-11-20 09:02:05,268 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:02:05,269 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:02:05,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:02:05,326 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;@5e8fd369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:02:05,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:02:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 09:02:05,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:05,343 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:05,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:05,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash -100183722, now seen corresponding path program 1 times [2024-11-20 09:02:05,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:05,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648202328] [2024-11-20 09:02:05,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:05,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:05,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:05,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648202328] [2024-11-20 09:02:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648202328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:05,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:05,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:02:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801494663] [2024-11-20 09:02:05,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:05,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:02:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:05,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:02:05,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:02:05,795 INFO L87 Difference]: Start difference. First operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:05,823 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2024-11-20 09:02:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:02:05,824 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-20 09:02:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:05,830 INFO L225 Difference]: With dead ends: 231 [2024-11-20 09:02:05,830 INFO L226 Difference]: Without dead ends: 115 [2024-11-20 09:02:05,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 09:02:05,835 INFO L432 NwaCegarLoop]: 168 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, 168 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 09:02:05,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-20 09:02:05,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-20 09:02:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-11-20 09:02:05,870 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2024-11-20 09:02:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:05,870 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-11-20 09:02:05,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-11-20 09:02:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 09:02:05,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:05,873 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:05,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:02:05,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:05,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:05,874 INFO L85 PathProgramCache]: Analyzing trace with hash 753164736, now seen corresponding path program 1 times [2024-11-20 09:02:05,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:05,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103835305] [2024-11-20 09:02:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103835305] [2024-11-20 09:02:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103835305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:02:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186744775] [2024-11-20 09:02:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:06,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:02:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:06,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:02:06,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:06,137 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:06,208 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2024-11-20 09:02:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:02:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-20 09:02:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:06,211 INFO L225 Difference]: With dead ends: 229 [2024-11-20 09:02:06,213 INFO L226 Difference]: Without dead ends: 117 [2024-11-20 09:02:06,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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 09:02:06,214 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 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 09:02:06,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-20 09:02:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-20 09:02:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-20 09:02:06,235 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2024-11-20 09:02:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:06,239 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-20 09:02:06,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-20 09:02:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 09:02:06,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:06,242 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:06,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:02:06,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:06,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash -122854270, now seen corresponding path program 1 times [2024-11-20 09:02:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:06,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935708619] [2024-11-20 09:02:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935708619] [2024-11-20 09:02:06,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935708619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:06,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:06,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:02:06,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846982560] [2024-11-20 09:02:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:02:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:06,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:02:06,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:06,569 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:06,614 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-11-20 09:02:06,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:02:06,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-20 09:02:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:06,617 INFO L225 Difference]: With dead ends: 234 [2024-11-20 09:02:06,619 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 09:02:06,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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 09:02:06,621 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:06,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 484 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 09:02:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-20 09:02:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-20 09:02:06,631 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2024-11-20 09:02:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:06,631 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-20 09:02:06,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-20 09:02:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 09:02:06,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:06,634 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:06,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:02:06,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:06,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash 557204100, now seen corresponding path program 1 times [2024-11-20 09:02:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314829478] [2024-11-20 09:02:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:06,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314829478] [2024-11-20 09:02:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314829478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:06,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:06,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:02:06,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480842908] [2024-11-20 09:02:06,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:06,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:02:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:02:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:06,820 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:06,857 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2024-11-20 09:02:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:02:06,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-20 09:02:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:06,862 INFO L225 Difference]: With dead ends: 238 [2024-11-20 09:02:06,862 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 09:02:06,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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 09:02:06,864 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:06,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 09:02:06,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-20 09:02:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-20 09:02:06,875 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2024-11-20 09:02:06,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:06,876 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-20 09:02:06,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-20 09:02:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 09:02:06,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:06,880 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:06,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:02:06,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:06,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1962755834, now seen corresponding path program 1 times [2024-11-20 09:02:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:06,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987268811] [2024-11-20 09:02:06,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:06,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:07,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:07,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987268811] [2024-11-20 09:02:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987268811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:07,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:02:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090513082] [2024-11-20 09:02:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:07,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:02:07,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:07,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:02:07,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:07,037 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:07,068 INFO L93 Difference]: Finished difference Result 242 states and 349 transitions. [2024-11-20 09:02:07,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:02:07,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-20 09:02:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:07,070 INFO L225 Difference]: With dead ends: 242 [2024-11-20 09:02:07,071 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 09:02:07,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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 09:02:07,072 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:07,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 09:02:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-20 09:02:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-11-20 09:02:07,084 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 143 [2024-11-20 09:02:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:07,085 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-11-20 09:02:07,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-11-20 09:02:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 09:02:07,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:07,089 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:07,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:02:07,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:07,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:07,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1960908792, now seen corresponding path program 1 times [2024-11-20 09:02:07,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:07,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563171921] [2024-11-20 09:02:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:07,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:07,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563171921] [2024-11-20 09:02:07,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563171921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:07,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:07,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:02:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357316779] [2024-11-20 09:02:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:07,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:02:07,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:02:07,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:02:07,751 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:07,983 INFO L93 Difference]: Finished difference Result 259 states and 369 transitions. [2024-11-20 09:02:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:02:07,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-20 09:02:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:07,985 INFO L225 Difference]: With dead ends: 259 [2024-11-20 09:02:07,985 INFO L226 Difference]: Without dead ends: 139 [2024-11-20 09:02:07,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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 09:02:07,987 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 88 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:07,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 440 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:02:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-20 09:02:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2024-11-20 09:02:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 115 states have internal predecessors, (152), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 09:02:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 194 transitions. [2024-11-20 09:02:08,001 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 194 transitions. Word has length 143 [2024-11-20 09:02:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:08,001 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 194 transitions. [2024-11-20 09:02:08,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 194 transitions. [2024-11-20 09:02:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 09:02:08,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:08,003 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:08,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:02:08,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:08,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash -224934086, now seen corresponding path program 1 times [2024-11-20 09:02:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019360742] [2024-11-20 09:02:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:08,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:08,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019360742] [2024-11-20 09:02:08,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019360742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:08,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:08,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:02:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391565728] [2024-11-20 09:02:08,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:08,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:02:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:02:08,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:02:08,264 INFO L87 Difference]: Start difference. First operand 138 states and 194 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:08,290 INFO L93 Difference]: Finished difference Result 267 states and 376 transitions. [2024-11-20 09:02:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:02:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-20 09:02:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:08,293 INFO L225 Difference]: With dead ends: 267 [2024-11-20 09:02:08,293 INFO L226 Difference]: Without dead ends: 141 [2024-11-20 09:02:08,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:02:08,294 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:08,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-20 09:02:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-20 09:02:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 118 states have internal predecessors, (155), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 09:02:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 197 transitions. [2024-11-20 09:02:08,305 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 197 transitions. Word has length 145 [2024-11-20 09:02:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:08,306 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 197 transitions. [2024-11-20 09:02:08,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 197 transitions. [2024-11-20 09:02:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 09:02:08,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:08,308 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:08,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:02:08,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:08,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash 885375514, now seen corresponding path program 1 times [2024-11-20 09:02:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498799189] [2024-11-20 09:02:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:08,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:08,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498799189] [2024-11-20 09:02:08,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498799189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:08,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:08,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508921735] [2024-11-20 09:02:08,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:08,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:08,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:08,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:08,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:08,877 INFO L87 Difference]: Start difference. First operand 141 states and 197 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:09,204 INFO L93 Difference]: Finished difference Result 271 states and 379 transitions. [2024-11-20 09:02:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:02:09,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-20 09:02:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:09,207 INFO L225 Difference]: With dead ends: 271 [2024-11-20 09:02:09,207 INFO L226 Difference]: Without dead ends: 142 [2024-11-20 09:02:09,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 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 09:02:09,208 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 83 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:09,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 563 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:02:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-20 09:02:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-20 09:02:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 116 states have internal predecessors, (152), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 09:02:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2024-11-20 09:02:09,219 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 146 [2024-11-20 09:02:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:09,219 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2024-11-20 09:02:09,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2024-11-20 09:02:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 09:02:09,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:09,221 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:09,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:02:09,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:09,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 945808159, now seen corresponding path program 1 times [2024-11-20 09:02:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630029277] [2024-11-20 09:02:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:09,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:10,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630029277] [2024-11-20 09:02:10,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630029277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:10,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:10,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:02:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419317134] [2024-11-20 09:02:10,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:10,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:02:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:10,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:02:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:02:10,021 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:10,292 INFO L93 Difference]: Finished difference Result 381 states and 535 transitions. [2024-11-20 09:02:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:02:10,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-20 09:02:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:10,294 INFO L225 Difference]: With dead ends: 381 [2024-11-20 09:02:10,294 INFO L226 Difference]: Without dead ends: 254 [2024-11-20 09:02:10,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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 09:02:10,294 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 146 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:10,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 364 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:02:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-20 09:02:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2024-11-20 09:02:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.3132530120481927) internal successors, (218), 166 states have internal predecessors, (218), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 09:02:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 286 transitions. [2024-11-20 09:02:10,311 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 286 transitions. Word has length 147 [2024-11-20 09:02:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:10,312 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 286 transitions. [2024-11-20 09:02:10,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 286 transitions. [2024-11-20 09:02:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 09:02:10,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:10,313 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:10,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:02:10,313 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1270086649, now seen corresponding path program 1 times [2024-11-20 09:02:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519901587] [2024-11-20 09:02:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:10,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:10,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:10,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519901587] [2024-11-20 09:02:10,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519901587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:10,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:10,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:02:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736982746] [2024-11-20 09:02:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:10,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:02:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:10,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:02:10,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:02:10,691 INFO L87 Difference]: Start difference. First operand 204 states and 286 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:10,891 INFO L93 Difference]: Finished difference Result 371 states and 516 transitions. [2024-11-20 09:02:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:02:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-20 09:02:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:10,895 INFO L225 Difference]: With dead ends: 371 [2024-11-20 09:02:10,895 INFO L226 Difference]: Without dead ends: 244 [2024-11-20 09:02:10,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:10,897 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 43 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:10,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 509 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:02:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-20 09:02:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 208. [2024-11-20 09:02:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 170 states have (on average 1.311764705882353) internal successors, (223), 170 states have internal predecessors, (223), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 09:02:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 291 transitions. [2024-11-20 09:02:10,910 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 291 transitions. Word has length 151 [2024-11-20 09:02:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:10,913 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 291 transitions. [2024-11-20 09:02:10,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 291 transitions. [2024-11-20 09:02:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 09:02:10,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:10,915 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:10,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:02:10,915 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:10,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1488941367, now seen corresponding path program 1 times [2024-11-20 09:02:10,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:10,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54647959] [2024-11-20 09:02:10,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:11,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54647959] [2024-11-20 09:02:11,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54647959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:11,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:11,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211806170] [2024-11-20 09:02:11,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:11,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:11,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:11,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:11,390 INFO L87 Difference]: Start difference. First operand 208 states and 291 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:11,734 INFO L93 Difference]: Finished difference Result 392 states and 544 transitions. [2024-11-20 09:02:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:02:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-20 09:02:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:11,737 INFO L225 Difference]: With dead ends: 392 [2024-11-20 09:02:11,737 INFO L226 Difference]: Without dead ends: 261 [2024-11-20 09:02:11,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 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 09:02:11,738 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 129 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:11,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 599 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:02:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-20 09:02:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 211. [2024-11-20 09:02:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 173 states have (on average 1.30635838150289) internal successors, (226), 173 states have internal predecessors, (226), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 09:02:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 294 transitions. [2024-11-20 09:02:11,752 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 294 transitions. Word has length 151 [2024-11-20 09:02:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:11,753 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 294 transitions. [2024-11-20 09:02:11,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 294 transitions. [2024-11-20 09:02:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 09:02:11,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:11,754 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:11,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:02:11,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:11,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash 422808358, now seen corresponding path program 1 times [2024-11-20 09:02:11,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:11,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806838300] [2024-11-20 09:02:11,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:11,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:13,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:13,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806838300] [2024-11-20 09:02:13,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806838300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:13,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:13,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:02:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120376466] [2024-11-20 09:02:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:13,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:02:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:13,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:02:13,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:02:13,157 INFO L87 Difference]: Start difference. First operand 211 states and 294 transitions. Second operand has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-20 09:02:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:13,688 INFO L93 Difference]: Finished difference Result 433 states and 595 transitions. [2024-11-20 09:02:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:02:13,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2024-11-20 09:02:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:13,690 INFO L225 Difference]: With dead ends: 433 [2024-11-20 09:02:13,690 INFO L226 Difference]: Without dead ends: 302 [2024-11-20 09:02:13,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:02:13,691 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 75 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:13,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 876 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:02:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-20 09:02:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2024-11-20 09:02:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 251 states have (on average 1.294820717131474) internal successors, (325), 252 states have internal predecessors, (325), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 09:02:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 409 transitions. [2024-11-20 09:02:13,705 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 409 transitions. Word has length 152 [2024-11-20 09:02:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:13,705 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 409 transitions. [2024-11-20 09:02:13,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-20 09:02:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 409 transitions. [2024-11-20 09:02:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 09:02:13,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:13,707 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:13,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:02:13,707 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:13,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1686606453, now seen corresponding path program 1 times [2024-11-20 09:02:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257810942] [2024-11-20 09:02:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:13,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:13,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257810942] [2024-11-20 09:02:13,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257810942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:13,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:13,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:02:13,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570088584] [2024-11-20 09:02:13,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:13,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:02:13,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:13,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:02:13,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:02:13,812 INFO L87 Difference]: Start difference. First operand 299 states and 409 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:13,830 INFO L93 Difference]: Finished difference Result 514 states and 705 transitions. [2024-11-20 09:02:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:02:13,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-11-20 09:02:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:13,832 INFO L225 Difference]: With dead ends: 514 [2024-11-20 09:02:13,832 INFO L226 Difference]: Without dead ends: 301 [2024-11-20 09:02:13,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 09:02:13,833 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:13,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-20 09:02:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-11-20 09:02:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 253 states have (on average 1.2924901185770752) internal successors, (327), 254 states have internal predecessors, (327), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 09:02:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2024-11-20 09:02:13,846 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 154 [2024-11-20 09:02:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:13,846 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2024-11-20 09:02:13,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2024-11-20 09:02:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 09:02:13,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:13,848 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 09:02:13,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1541026190, now seen corresponding path program 1 times [2024-11-20 09:02:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688035120] [2024-11-20 09:02:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688035120] [2024-11-20 09:02:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688035120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:14,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:14,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623107946] [2024-11-20 09:02:14,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:14,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:02:14,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:14,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:02:14,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:14,729 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:15,253 INFO L93 Difference]: Finished difference Result 313 states and 423 transitions. [2024-11-20 09:02:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:15,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2024-11-20 09:02:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:15,255 INFO L225 Difference]: With dead ends: 313 [2024-11-20 09:02:15,255 INFO L226 Difference]: Without dead ends: 311 [2024-11-20 09:02:15,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:02:15,256 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 96 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:15,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 810 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:02:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-20 09:02:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-20 09:02:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 262 states have (on average 1.282442748091603) internal successors, (336), 263 states have internal predecessors, (336), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 09:02:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 420 transitions. [2024-11-20 09:02:15,287 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 420 transitions. Word has length 154 [2024-11-20 09:02:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:15,288 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 420 transitions. [2024-11-20 09:02:15,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 420 transitions. [2024-11-20 09:02:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 09:02:15,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:15,289 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:15,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:02:15,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:15,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1539179148, now seen corresponding path program 1 times [2024-11-20 09:02:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:15,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958944928] [2024-11-20 09:02:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 09:02:16,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:16,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958944928] [2024-11-20 09:02:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958944928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:02:16,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588299148] [2024-11-20 09:02:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:16,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:02:16,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:16,713 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 09:02:16,715 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 09:02:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:17,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-20 09:02:17,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:17,122 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 55 treesize of output 54 [2024-11-20 09:02:17,244 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 82 treesize of output 71 [2024-11-20 09:02:17,491 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 86 treesize of output 73 [2024-11-20 09:02:17,632 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 90 treesize of output 75 [2024-11-20 09:02:17,796 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 94 treesize of output 77 [2024-11-20 09:02:17,935 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 98 treesize of output 79 [2024-11-20 09:02:18,058 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 102 treesize of output 81 [2024-11-20 09:02:18,386 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 115 treesize of output 90 [2024-11-20 09:02:18,656 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 121 treesize of output 94 [2024-11-20 09:02:18,846 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 121 treesize of output 94 [2024-11-20 09:02:19,176 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 125 treesize of output 96 [2024-11-20 09:02:19,343 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 139 treesize of output 108 [2024-11-20 09:02:19,453 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 129 treesize of output 98 [2024-11-20 09:02:19,724 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 132 treesize of output 98 [2024-11-20 09:02:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 504 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-20 09:02:19,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:02:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 09:02:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588299148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:02:20,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:02:20,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 9] total 33 [2024-11-20 09:02:20,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74380369] [2024-11-20 09:02:20,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:02:20,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-20 09:02:20,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:20,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-20 09:02:20,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 09:02:20,189 INFO L87 Difference]: Start difference. First operand 311 states and 420 transitions. Second operand has 33 states, 29 states have (on average 7.620689655172414) internal successors, (221), 32 states have internal predecessors, (221), 17 states have call successors, (51), 9 states have call predecessors, (51), 12 states have return successors, (51), 14 states have call predecessors, (51), 17 states have call successors, (51) [2024-11-20 09:02:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:24,584 INFO L93 Difference]: Finished difference Result 857 states and 1124 transitions. [2024-11-20 09:02:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-20 09:02:24,585 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 7.620689655172414) internal successors, (221), 32 states have internal predecessors, (221), 17 states have call successors, (51), 9 states have call predecessors, (51), 12 states have return successors, (51), 14 states have call predecessors, (51), 17 states have call successors, (51) Word has length 154 [2024-11-20 09:02:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:24,595 INFO L225 Difference]: With dead ends: 857 [2024-11-20 09:02:24,595 INFO L226 Difference]: Without dead ends: 613 [2024-11-20 09:02:24,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1002, Invalid=3554, Unknown=0, NotChecked=0, Total=4556 [2024-11-20 09:02:24,598 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 457 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:24,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1401 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 09:02:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-20 09:02:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 587. [2024-11-20 09:02:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 500 states have (on average 1.268) internal successors, (634), 502 states have internal predecessors, (634), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-20 09:02:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 768 transitions. [2024-11-20 09:02:24,670 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 768 transitions. Word has length 154 [2024-11-20 09:02:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:24,672 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 768 transitions. [2024-11-20 09:02:24,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 7.620689655172414) internal successors, (221), 32 states have internal predecessors, (221), 17 states have call successors, (51), 9 states have call predecessors, (51), 12 states have return successors, (51), 14 states have call predecessors, (51), 17 states have call successors, (51) [2024-11-20 09:02:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 768 transitions. [2024-11-20 09:02:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 09:02:24,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:24,678 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:24,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 09:02:24,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-20 09:02:24,881 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:24,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2018937927, now seen corresponding path program 1 times [2024-11-20 09:02:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415736330] [2024-11-20 09:02:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415736330] [2024-11-20 09:02:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415736330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:25,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308221791] [2024-11-20 09:02:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:25,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:25,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:25,778 INFO L87 Difference]: Start difference. First operand 587 states and 768 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:26,091 INFO L93 Difference]: Finished difference Result 1139 states and 1508 transitions. [2024-11-20 09:02:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:02:26,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-11-20 09:02:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:26,095 INFO L225 Difference]: With dead ends: 1139 [2024-11-20 09:02:26,097 INFO L226 Difference]: Without dead ends: 889 [2024-11-20 09:02:26,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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 09:02:26,098 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 80 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:26,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 513 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:02:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-20 09:02:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 596. [2024-11-20 09:02:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 509 states have (on average 1.269155206286837) internal successors, (646), 511 states have internal predecessors, (646), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-20 09:02:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 780 transitions. [2024-11-20 09:02:26,133 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 780 transitions. Word has length 156 [2024-11-20 09:02:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:26,134 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 780 transitions. [2024-11-20 09:02:26,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 780 transitions. [2024-11-20 09:02:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 09:02:26,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:26,135 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:26,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 09:02:26,136 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:26,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash -258180644, now seen corresponding path program 1 times [2024-11-20 09:02:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563266513] [2024-11-20 09:02:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:27,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563266513] [2024-11-20 09:02:27,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563266513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:27,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:27,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:27,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602796829] [2024-11-20 09:02:27,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:27,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:27,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:27,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:27,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:27,350 INFO L87 Difference]: Start difference. First operand 596 states and 780 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:27,627 INFO L93 Difference]: Finished difference Result 1333 states and 1760 transitions. [2024-11-20 09:02:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:02:27,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-11-20 09:02:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:27,630 INFO L225 Difference]: With dead ends: 1333 [2024-11-20 09:02:27,631 INFO L226 Difference]: Without dead ends: 877 [2024-11-20 09:02:27,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 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 09:02:27,632 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 126 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:27,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 444 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:02:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-11-20 09:02:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 669. [2024-11-20 09:02:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 582 states have (on average 1.2766323024054982) internal successors, (743), 584 states have internal predecessors, (743), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-20 09:02:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 877 transitions. [2024-11-20 09:02:27,663 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 877 transitions. Word has length 156 [2024-11-20 09:02:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:27,664 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 877 transitions. [2024-11-20 09:02:27,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 877 transitions. [2024-11-20 09:02:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 09:02:27,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:27,665 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:27,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 09:02:27,666 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:27,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:27,666 INFO L85 PathProgramCache]: Analyzing trace with hash 189485414, now seen corresponding path program 1 times [2024-11-20 09:02:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043298308] [2024-11-20 09:02:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:27,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043298308] [2024-11-20 09:02:27,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043298308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:27,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:02:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326613951] [2024-11-20 09:02:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:27,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:02:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:27,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:02:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:02:27,748 INFO L87 Difference]: Start difference. First operand 669 states and 877 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:27,782 INFO L93 Difference]: Finished difference Result 1206 states and 1597 transitions. [2024-11-20 09:02:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:02:27,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-20 09:02:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:27,785 INFO L225 Difference]: With dead ends: 1206 [2024-11-20 09:02:27,786 INFO L226 Difference]: Without dead ends: 676 [2024-11-20 09:02:27,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 09:02:27,787 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:27,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-20 09:02:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2024-11-20 09:02:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 589 states have (on average 1.2733446519524618) internal successors, (750), 591 states have internal predecessors, (750), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-20 09:02:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 884 transitions. [2024-11-20 09:02:27,829 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 884 transitions. Word has length 156 [2024-11-20 09:02:27,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:27,830 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 884 transitions. [2024-11-20 09:02:27,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 884 transitions. [2024-11-20 09:02:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 09:02:27,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:27,831 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:27,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 09:02:27,831 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:27,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1595291205, now seen corresponding path program 1 times [2024-11-20 09:02:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:27,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393123377] [2024-11-20 09:02:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:28,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:28,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393123377] [2024-11-20 09:02:28,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393123377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:28,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:28,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358363704] [2024-11-20 09:02:28,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:28,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:28,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:28,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:28,216 INFO L87 Difference]: Start difference. First operand 676 states and 884 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:28,633 INFO L93 Difference]: Finished difference Result 1458 states and 1919 transitions. [2024-11-20 09:02:28,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:02:28,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-20 09:02:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:28,637 INFO L225 Difference]: With dead ends: 1458 [2024-11-20 09:02:28,637 INFO L226 Difference]: Without dead ends: 893 [2024-11-20 09:02:28,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:02:28,638 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 139 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:28,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 530 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:02:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-11-20 09:02:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 675. [2024-11-20 09:02:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 588 states have (on average 1.2704081632653061) internal successors, (747), 590 states have internal predecessors, (747), 67 states have call successors, (67), 19 states have call predecessors, (67), 19 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-20 09:02:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 881 transitions. [2024-11-20 09:02:28,665 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 881 transitions. Word has length 156 [2024-11-20 09:02:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:28,665 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 881 transitions. [2024-11-20 09:02:28,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 881 transitions. [2024-11-20 09:02:28,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 09:02:28,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:28,666 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:28,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 09:02:28,666 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:28,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:28,667 INFO L85 PathProgramCache]: Analyzing trace with hash -625743125, now seen corresponding path program 1 times [2024-11-20 09:02:28,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:28,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867745470] [2024-11-20 09:02:28,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:02:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:02:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:02:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:02:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:02:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:02:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:02:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:02:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:02:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:02:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:02:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:02:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:02:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:02:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:02:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:02:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:02:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:29,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:02:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867745470] [2024-11-20 09:02:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867745470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:29,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:29,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:02:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030262941] [2024-11-20 09:02:29,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:29,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:02:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:02:29,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:02:29,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:02:29,603 INFO L87 Difference]: Start difference. First operand 675 states and 881 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:30,197 INFO L93 Difference]: Finished difference Result 1471 states and 1933 transitions. [2024-11-20 09:02:30,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:02:30,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 158 [2024-11-20 09:02:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:30,200 INFO L225 Difference]: With dead ends: 1471 [2024-11-20 09:02:30,200 INFO L226 Difference]: Without dead ends: 961 [2024-11-20 09:02:30,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:02:30,201 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 184 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:30,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 664 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:02:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-11-20 09:02:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 921. [2024-11-20 09:02:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 797 states have (on average 1.2534504391468004) internal successors, (999), 801 states have internal predecessors, (999), 97 states have call successors, (97), 26 states have call predecessors, (97), 26 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-20 09:02:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1193 transitions. [2024-11-20 09:02:30,266 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1193 transitions. Word has length 158 [2024-11-20 09:02:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:30,266 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1193 transitions. [2024-11-20 09:02:30,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1193 transitions. [2024-11-20 09:02:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 09:02:30,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:30,267 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 09:02:30,268 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:30,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1578950146, now seen corresponding path program 1 times [2024-11-20 09:02:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:02:30,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270134789] [2024-11-20 09:02:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:30,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:02:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:02:30,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:02:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:02:30,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:02:30,437 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:02:30,438 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 09:02:30,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 09:02:30,441 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] [2024-11-20 09:02:30,498 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:02:30,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:02:30 BoogieIcfgContainer [2024-11-20 09:02:30,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:02:30,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:02:30,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:02:30,502 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:02:30,502 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:02:05" (3/4) ... [2024-11-20 09:02:30,504 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 09:02:30,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:02:30,505 INFO L158 Benchmark]: Toolchain (without parser) took 26649.65ms. Allocated memory was 169.9MB in the beginning and 822.1MB in the end (delta: 652.2MB). Free memory was 100.1MB in the beginning and 643.9MB in the end (delta: -543.8MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. [2024-11-20 09:02:30,506 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory was 127.2MB in the beginning and 127.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:02:30,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.34ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 137.6MB in the end (delta: -37.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 09:02:30,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.41ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 133.4MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:02:30,506 INFO L158 Benchmark]: Boogie Preprocessor took 75.76ms. Allocated memory is still 169.9MB. Free memory was 133.4MB in the beginning and 129.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:02:30,507 INFO L158 Benchmark]: RCFGBuilder took 824.16ms. Allocated memory is still 169.9MB. Free memory was 129.2MB in the beginning and 92.7MB in the end (delta: 36.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-20 09:02:30,507 INFO L158 Benchmark]: TraceAbstraction took 25249.84ms. Allocated memory was 169.9MB in the beginning and 822.1MB in the end (delta: 652.2MB). Free memory was 92.1MB in the beginning and 643.9MB in the end (delta: -551.8MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2024-11-20 09:02:30,507 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 822.1MB. Free memory is still 643.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:02:30,509 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.16ms. Allocated memory is still 169.9MB. Free memory was 127.2MB in the beginning and 127.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.34ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 137.6MB in the end (delta: -37.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.41ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 133.4MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.76ms. Allocated memory is still 169.9MB. Free memory was 133.4MB in the beginning and 129.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 824.16ms. Allocated memory is still 169.9MB. Free memory was 129.2MB in the beginning and 92.7MB in the end (delta: 36.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25249.84ms. Allocated memory was 169.9MB in the beginning and 822.1MB in the end (delta: 652.2MB). Free memory was 92.1MB in the beginning and 643.9MB in the end (delta: -551.8MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 822.1MB. Free memory is still 643.9MB. 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 124, overapproximation of bitwiseOr at line 124. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L59] unsigned long int last_1_WrapperStruct00_var_1_10 = 25; [L60] signed short int last_1_WrapperStruct00_var_1_15 = -16; [L61] unsigned char last_1_WrapperStruct00_var_1_18 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L119] EXPR WrapperStruct00.var_1_10 [L119] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_15 [L120] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L121] EXPR WrapperStruct00.var_1_18 [L121] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L97] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L110] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L112] WrapperStruct00.var_1_17 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_17 [L113] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_17 [L113] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] EXPR (WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L114] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L132] RET updateVariables() [L133] CALL step() [L65] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L65] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 [L65] EXPR WrapperStruct00.var_1_5 [L65] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L65] COND FALSE !(((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) [L72] EXPR WrapperStruct00.var_1_7 [L72] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L74] WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L74] COND FALSE !(WrapperStruct00.var_1_5) [L77] EXPR WrapperStruct00.var_1_12 [L77] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L77] COND TRUE WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8 [L78] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L78] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L78] EXPR WrapperStruct00.var_1_8 [L78] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L78] WrapperStruct00.var_1_14 = ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) [L80] WrapperStruct00.var_1_15 = 2 [L81] EXPR WrapperStruct00.var_1_17 [L81] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L82] EXPR WrapperStruct00.var_1_19 [L82] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L83] EXPR WrapperStruct00.var_1_8 [L83] EXPR WrapperStruct00.var_1_1 [L83] unsigned char stepLocal_0 = WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1; [L84] stepLocal_0 && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L84] COND FALSE !(stepLocal_0 && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) [L87] EXPR WrapperStruct00.var_1_11 [L87] EXPR WrapperStruct00.var_1_13 [L87] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 [L124] EXPR WrapperStruct00.var_1_5 [L124] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L124] EXPR WrapperStruct00.var_1_1 [L124] EXPR WrapperStruct00.var_1_7 [L124] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1) [L124] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13)))) [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR WrapperStruct00.var_1_1 [L124] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))) [L124] EXPR WrapperStruct00.var_1_10 [L124] EXPR WrapperStruct00.var_1_11 [L124] EXPR WrapperStruct00.var_1_13 [L124] EXPR ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1) [L124] EXPR WrapperStruct00.var_1_12 [L124] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1 [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2)) [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17)) [L124] EXPR WrapperStruct00.var_1_16 [L124] EXPR WrapperStruct00.var_1_17 [L124] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124-L125] return (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.1s, OverallIterations: 21, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1657 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1649 mSDsluCounter, 11116 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8069 mSDsCounter, 460 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5169 IncrementalHoareTripleChecker+Invalid, 5629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 460 mSolverCounterUnsat, 3047 mSDtfsCounter, 5169 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1230 GetRequests, 1083 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=20, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 931 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 3306 NumberOfCodeBlocks, 3306 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3280 ConstructedInterpolants, 0 QuantifiedInterpolants, 23357 SizeOfPredicates, 6 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 11434/11968 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 09:02:30,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-88.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 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:02:32,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:02:32,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 09:02:32,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:02:32,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:02:32,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:02:32,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:02:32,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:02:32,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:02:32,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:02:32,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:02:32,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:02:32,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:02:32,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:02:32,687 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:02:32,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:02:32,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:02:32,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:02:32,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:02:32,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:02:32,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:02:32,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:02:32,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:02:32,692 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 09:02:32,693 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 09:02:32,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:02:32,693 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 09:02:32,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:02:32,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:02:32,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:02:32,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:02:32,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:02:32,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:02:32,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:02:32,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:02:32,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:02:32,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:02:32,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:02:32,695 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 09:02:32,695 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 09:02:32,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:02:32,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:02:32,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:02:32,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:02:32,697 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 -> 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd [2024-11-20 09:02:32,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:02:32,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:02:32,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:02:32,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:02:32,997 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:02:32,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-11-20 09:02:34,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:02:34,538 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:02:34,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-11-20 09:02:34,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78f73d06a/abee2d23d79e4b20a2e31e6dc4b211b2/FLAG7a7bcfe71 [2024-11-20 09:02:34,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78f73d06a/abee2d23d79e4b20a2e31e6dc4b211b2 [2024-11-20 09:02:34,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:02:34,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:02:34,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:02:34,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:02:34,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:02:34,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:02:34" (1/1) ... [2024-11-20 09:02:34,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6770a6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:34, skipping insertion in model container [2024-11-20 09:02:34,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:02:34" (1/1) ... [2024-11-20 09:02:34,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:02:35,116 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-88.i[916,929] [2024-11-20 09:02:35,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:02:35,200 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:02:35,213 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-88.i[916,929] [2024-11-20 09:02:35,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:02:35,285 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:02:35,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35 WrapperNode [2024-11-20 09:02:35,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:02:35,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:02:35,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:02:35,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:02:35,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,363 INFO L138 Inliner]: procedures = 37, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-20 09:02:35,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:02:35,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:02:35,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:02:35,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:02:35,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,407 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-20 09:02:35,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:02:35,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:02:35,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:02:35,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:02:35,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (1/1) ... [2024-11-20 09:02:35,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:02:35,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:02:35,496 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 09:02:35,499 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 09:02:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:02:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 09:02:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 09:02:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 09:02:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 09:02:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 09:02:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 09:02:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-20 09:02:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-20 09:02:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-20 09:02:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:02:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:02:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-20 09:02:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-20 09:02:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:02:35,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:02:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 09:02:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 09:02:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 09:02:35,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 09:02:35,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 09:02:35,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 09:02:35,656 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:02:35,657 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:02:36,197 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-20 09:02:36,198 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:02:36,211 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:02:36,211 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:02:36,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:02:36 BoogieIcfgContainer [2024-11-20 09:02:36,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:02:36,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:02:36,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:02:36,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:02:36,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:02:34" (1/3) ... [2024-11-20 09:02:36,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc963aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:02:36, skipping insertion in model container [2024-11-20 09:02:36,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:02:35" (2/3) ... [2024-11-20 09:02:36,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc963aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:02:36, skipping insertion in model container [2024-11-20 09:02:36,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:02:36" (3/3) ... [2024-11-20 09:02:36,220 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-88.i [2024-11-20 09:02:36,236 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:02:36,236 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:02:36,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:02:36,297 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;@1475381c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:02:36,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:02:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 09:02:36,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:36,310 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:36,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:36,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash -700881897, now seen corresponding path program 1 times [2024-11-20 09:02:36,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:02:36,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601136475] [2024-11-20 09:02:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:36,324 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 09:02:36,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:02:36,327 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 09:02:36,328 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 09:02:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:36,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 09:02:36,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-20 09:02:36,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:02:36,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:02:36,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601136475] [2024-11-20 09:02:36,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601136475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:36,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:02:36,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424914995] [2024-11-20 09:02:36,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:36,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:02:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:02:36,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:02:36,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:02:36,628 INFO L87 Difference]: Start difference. First operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:36,652 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2024-11-20 09:02:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:02:36,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-11-20 09:02:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:36,659 INFO L225 Difference]: With dead ends: 215 [2024-11-20 09:02:36,659 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 09:02:36,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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 09:02:36,664 INFO L432 NwaCegarLoop]: 156 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, 156 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 09:02:36,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:02:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 09:02:36,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-20 09:02:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-11-20 09:02:36,698 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 139 [2024-11-20 09:02:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:36,698 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-11-20 09:02:36,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 09:02:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-11-20 09:02:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 09:02:36,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:36,701 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:36,707 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 (2)] Ended with exit code 0 [2024-11-20 09:02:36,902 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 09:02:36,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:36,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash -298632831, now seen corresponding path program 1 times [2024-11-20 09:02:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:02:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510739351] [2024-11-20 09:02:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:36,910 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 09:02:36,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:02:36,911 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 09:02:36,913 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 09:02:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:37,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 09:02:37,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:37,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:02:37,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:02:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510739351] [2024-11-20 09:02:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510739351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:37,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:37,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:02:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225436032] [2024-11-20 09:02:37,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:37,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:02:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:02:37,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:02:37,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:37,175 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:37,273 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2024-11-20 09:02:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:02:37,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-20 09:02:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:37,275 INFO L225 Difference]: With dead ends: 218 [2024-11-20 09:02:37,275 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 09:02:37,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:02:37,277 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:37,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:02:37,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 09:02:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-20 09:02:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-11-20 09:02:37,288 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 139 [2024-11-20 09:02:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:37,289 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-11-20 09:02:37,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-11-20 09:02:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 09:02:37,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:37,291 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:37,300 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 09:02:37,495 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 09:02:37,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:37,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 381425539, now seen corresponding path program 1 times [2024-11-20 09:02:37,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:02:37,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446021575] [2024-11-20 09:02:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:37,497 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 09:02:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:02:37,500 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 09:02:37,501 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 09:02:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:37,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 09:02:37,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 09:02:37,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:02:37,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:02:37,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446021575] [2024-11-20 09:02:37,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446021575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:02:37,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:02:37,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:02:37,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050662864] [2024-11-20 09:02:37,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:02:37,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:02:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:02:37,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:02:37,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:02:37,736 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:02:37,823 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2024-11-20 09:02:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:02:37,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-20 09:02:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:02:37,827 INFO L225 Difference]: With dead ends: 228 [2024-11-20 09:02:37,827 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 09:02:37,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:02:37,829 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:02:37,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 992 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:02:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 09:02:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-20 09:02:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 09:02:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-20 09:02:37,863 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 139 [2024-11-20 09:02:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:02:37,864 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-20 09:02:37,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 09:02:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-20 09:02:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 09:02:37,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:02:37,870 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:37,877 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 09:02:38,070 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 09:02:38,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:02:38,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:02:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash 383272581, now seen corresponding path program 1 times [2024-11-20 09:02:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:02:38,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939008966] [2024-11-20 09:02:38,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:02:38,080 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 09:02:38,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:02:38,083 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 09:02:38,086 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 09:02:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:02:38,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 09:02:38,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:02:38,443 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 87 treesize of output 86 [2024-11-20 09:02:38,683 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 165 treesize of output 138 [2024-11-20 09:02:39,152 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 170 treesize of output 143 [2024-11-20 09:02:39,626 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 165 treesize of output 138 [2024-11-20 09:02:40,326 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 160 treesize of output 135 [2024-11-20 09:02:41,623 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 160 treesize of output 137 [2024-11-20 09:02:48,509 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 160 treesize of output 137 [2024-11-20 09:03:07,855 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 175 treesize of output 148 [2024-11-20 09:03:26,673 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 181 treesize of output 152