./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.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 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:15:31,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:15:31,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:15:31,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:15:31,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:15:31,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:15:31,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:15:31,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:15:31,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:15:31,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:15:31,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:15:31,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:15:31,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:15:31,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:15:31,784 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:15:31,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:15:31,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:15:31,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:15:31,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:15:31,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:15:31,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:15:31,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:15:31,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:15:31,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:15:31,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:15:31,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:15:31,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:15:31,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:15:31,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:15:31,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:15:31,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:15:31,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:15:31,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:15:31,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:15:31,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:15:31,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:15:31,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:15:31,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:15:31,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:15:31,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:15:31,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:15:31,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:15:31,791 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 -> 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 [2024-11-08 23:15:31,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:15:32,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:15:32,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:15:32,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:15:32,010 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:15:32,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-08 23:15:33,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:15:33,428 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:15:33,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-08 23:15:33,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1c0462e/ed43d50eaf44471291f40161848ae26f/FLAG5ccb48ecc [2024-11-08 23:15:33,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1c0462e/ed43d50eaf44471291f40161848ae26f [2024-11-08 23:15:33,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:15:33,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:15:33,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:33,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:15:33,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:15:33,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:33" (1/1) ... [2024-11-08 23:15:33,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e14a547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:33, skipping insertion in model container [2024-11-08 23:15:33,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:33" (1/1) ... [2024-11-08 23:15:33,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:15:33,995 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2024-11-08 23:15:34,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:34,034 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:15:34,044 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2024-11-08 23:15:34,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:34,076 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:15:34,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34 WrapperNode [2024-11-08 23:15:34,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:34,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:34,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:15:34,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:15:34,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,117 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-11-08 23:15:34,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:34,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:15:34,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:15:34,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:15:34,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:15:34,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:15:34,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:15:34,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:15:34,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:15:34,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (1/1) ... [2024-11-08 23:15:34,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:15:34,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:34,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:15:34,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:15:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:15:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:15:34,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:15:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:15:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:15:34,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:15:34,301 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:15:34,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:15:34,531 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 23:15:34,531 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:15:34,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:15:34,546 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:15:34,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:34 BoogieIcfgContainer [2024-11-08 23:15:34,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:15:34,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:15:34,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:15:34,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:15:34,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:15:33" (1/3) ... [2024-11-08 23:15:34,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27473e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:15:34, skipping insertion in model container [2024-11-08 23:15:34,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:34" (2/3) ... [2024-11-08 23:15:34,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27473e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:15:34, skipping insertion in model container [2024-11-08 23:15:34,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:34" (3/3) ... [2024-11-08 23:15:34,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-08 23:15:34,569 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:15:34,569 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:15:34,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:15:34,623 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;@21c66542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:15:34,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:15:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:15:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:15:34,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:34,636 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:34,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:34,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash 273559296, now seen corresponding path program 1 times [2024-11-08 23:15:34,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:34,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492889717] [2024-11-08 23:15:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:34,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:34,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492889717] [2024-11-08 23:15:34,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492889717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:35,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:35,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:15:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016034706] [2024-11-08 23:15:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:35,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:15:35,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:35,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:15:35,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:15:35,028 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:15:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:35,053 INFO L93 Difference]: Finished difference Result 121 states and 206 transitions. [2024-11-08 23:15:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:15:35,055 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-08 23:15:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:35,063 INFO L225 Difference]: With dead ends: 121 [2024-11-08 23:15:35,064 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 23:15:35,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:15:35,069 INFO L432 NwaCegarLoop]: 90 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, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:35,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:15:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 23:15:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-08 23:15:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:15:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2024-11-08 23:15:35,101 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 113 [2024-11-08 23:15:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:35,101 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2024-11-08 23:15:35,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:15:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2024-11-08 23:15:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:15:35,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:35,106 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:35,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:15:35,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:35,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1565859904, now seen corresponding path program 1 times [2024-11-08 23:15:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:35,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065677391] [2024-11-08 23:15:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:35,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:35,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:36,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065677391] [2024-11-08 23:15:36,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065677391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:36,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:36,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:15:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011030382] [2024-11-08 23:15:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:15:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:36,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:15:36,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:15:36,013 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:36,148 INFO L93 Difference]: Finished difference Result 136 states and 203 transitions. [2024-11-08 23:15:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:15:36,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-08 23:15:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:36,151 INFO L225 Difference]: With dead ends: 136 [2024-11-08 23:15:36,152 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 23:15:36,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:15:36,153 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:36,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 221 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:15:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 23:15:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2024-11-08 23:15:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:15:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2024-11-08 23:15:36,166 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 113 [2024-11-08 23:15:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:36,168 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2024-11-08 23:15:36,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2024-11-08 23:15:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:15:36,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:36,171 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:36,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:15:36,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:36,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1869013579, now seen corresponding path program 1 times [2024-11-08 23:15:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:36,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983068854] [2024-11-08 23:15:36,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983068854] [2024-11-08 23:15:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983068854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:36,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:36,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:15:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238718119] [2024-11-08 23:15:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:36,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:15:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:15:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:15:36,754 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:37,202 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2024-11-08 23:15:37,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:15:37,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-08 23:15:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:37,204 INFO L225 Difference]: With dead ends: 226 [2024-11-08 23:15:37,205 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 23:15:37,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:15:37,206 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 168 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:37,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 388 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:15:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 23:15:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 67. [2024-11-08 23:15:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:15:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-11-08 23:15:37,215 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 115 [2024-11-08 23:15:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:37,215 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-11-08 23:15:37,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-11-08 23:15:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:15:37,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:37,217 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:37,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:15:37,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:37,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2100365159, now seen corresponding path program 1 times [2024-11-08 23:15:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:37,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660370142] [2024-11-08 23:15:37,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:37,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-08 23:15:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660370142] [2024-11-08 23:15:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660370142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:15:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5005639] [2024-11-08 23:15:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:37,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:37,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:37,602 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-08 23:15:37,603 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-08 23:15:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:37,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:15:37,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:15:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 348 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 23:15:37,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:15:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-08 23:15:38,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5005639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:15:38,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:15:38,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-08 23:15:38,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279132719] [2024-11-08 23:15:38,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:15:38,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 23:15:38,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:38,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 23:15:38,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:15:38,112 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2024-11-08 23:15:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:38,491 INFO L93 Difference]: Finished difference Result 163 states and 237 transitions. [2024-11-08 23:15:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 23:15:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 115 [2024-11-08 23:15:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:38,494 INFO L225 Difference]: With dead ends: 163 [2024-11-08 23:15:38,494 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 23:15:38,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2024-11-08 23:15:38,496 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 196 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:38,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 264 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:15:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 23:15:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2024-11-08 23:15:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:15:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-08 23:15:38,506 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 115 [2024-11-08 23:15:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:38,506 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-08 23:15:38,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2024-11-08 23:15:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-08 23:15:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:15:38,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:38,508 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:38,523 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-08 23:15:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:38,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1316545057, now seen corresponding path program 1 times [2024-11-08 23:15:38,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:38,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576987104] [2024-11-08 23:15:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-08 23:15:39,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:39,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576987104] [2024-11-08 23:15:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576987104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:15:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172543518] [2024-11-08 23:15:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:39,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:39,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:39,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:15:39,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:15:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:39,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 23:15:39,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:15:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 408 proven. 72 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-08 23:15:40,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:15:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 42 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-08 23:15:42,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172543518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:15:42,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:15:42,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 19] total 45 [2024-11-08 23:15:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116373283] [2024-11-08 23:15:42,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:15:42,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-08 23:15:42,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-08 23:15:42,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2024-11-08 23:15:42,293 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 45 states have internal predecessors, (95), 10 states have call successors, (41), 5 states have call predecessors, (41), 12 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2024-11-08 23:15:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:43,920 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2024-11-08 23:15:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-08 23:15:43,921 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 45 states have internal predecessors, (95), 10 states have call successors, (41), 5 states have call predecessors, (41), 12 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) Word has length 116 [2024-11-08 23:15:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:43,922 INFO L225 Difference]: With dead ends: 162 [2024-11-08 23:15:43,922 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 23:15:43,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1121, Invalid=3709, Unknown=0, NotChecked=0, Total=4830 [2024-11-08 23:15:43,925 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 235 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:43,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 656 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 23:15:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 23:15:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2024-11-08 23:15:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.153061224489796) internal successors, (113), 100 states have internal predecessors, (113), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 23:15:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 189 transitions. [2024-11-08 23:15:43,941 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 189 transitions. Word has length 116 [2024-11-08 23:15:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:43,941 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 189 transitions. [2024-11-08 23:15:43,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 45 states have internal predecessors, (95), 10 states have call successors, (41), 5 states have call predecessors, (41), 12 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2024-11-08 23:15:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 189 transitions. [2024-11-08 23:15:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:15:43,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:43,942 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:43,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:15:44,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:44,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:44,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1231369325, now seen corresponding path program 1 times [2024-11-08 23:15:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:44,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750543709] [2024-11-08 23:15:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:44,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750543709] [2024-11-08 23:15:44,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750543709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:44,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:15:44,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123022469] [2024-11-08 23:15:44,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:44,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:15:44,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:44,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:15:44,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:15:44,215 INFO L87 Difference]: Start difference. First operand 147 states and 189 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:44,240 INFO L93 Difference]: Finished difference Result 272 states and 344 transitions. [2024-11-08 23:15:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:15:44,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-08 23:15:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:44,242 INFO L225 Difference]: With dead ends: 272 [2024-11-08 23:15:44,243 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 23:15:44,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-08 23:15:44,244 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 11 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 158 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-08 23:15:44,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 158 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:15:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 23:15:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2024-11-08 23:15:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 92 states have internal predecessors, (101), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 23:15:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 177 transitions. [2024-11-08 23:15:44,268 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 177 transitions. Word has length 118 [2024-11-08 23:15:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:44,269 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 177 transitions. [2024-11-08 23:15:44,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2024-11-08 23:15:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:15:44,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:44,270 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:44,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:15:44,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:44,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:44,273 INFO L85 PathProgramCache]: Analyzing trace with hash 990142997, now seen corresponding path program 1 times [2024-11-08 23:15:44,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:44,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071092517] [2024-11-08 23:15:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:44,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071092517] [2024-11-08 23:15:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071092517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:44,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:44,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:15:44,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269467486] [2024-11-08 23:15:44,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:44,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:15:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:44,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:15:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:15:44,367 INFO L87 Difference]: Start difference. First operand 139 states and 177 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:15:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:44,454 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2024-11-08 23:15:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:15:44,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-11-08 23:15:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:44,456 INFO L225 Difference]: With dead ends: 255 [2024-11-08 23:15:44,456 INFO L226 Difference]: Without dead ends: 139 [2024-11-08 23:15:44,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-08 23:15:44,458 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:44,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 65 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:15:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-08 23:15:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-08 23:15:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.1) internal successors, (99), 92 states have internal predecessors, (99), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 23:15:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 175 transitions. [2024-11-08 23:15:44,475 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 175 transitions. Word has length 118 [2024-11-08 23:15:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:44,475 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 175 transitions. [2024-11-08 23:15:44,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:15:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 175 transitions. [2024-11-08 23:15:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 23:15:44,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:44,476 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:44,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:15:44,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:44,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash -477987345, now seen corresponding path program 1 times [2024-11-08 23:15:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:44,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403536717] [2024-11-08 23:15:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:44,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403536717] [2024-11-08 23:15:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403536717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:44,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:15:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298130915] [2024-11-08 23:15:44,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:44,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:15:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:44,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:15:44,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:15:44,557 INFO L87 Difference]: Start difference. First operand 139 states and 175 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:44,725 INFO L93 Difference]: Finished difference Result 404 states and 502 transitions. [2024-11-08 23:15:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:15:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-08 23:15:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:44,727 INFO L225 Difference]: With dead ends: 404 [2024-11-08 23:15:44,728 INFO L226 Difference]: Without dead ends: 288 [2024-11-08 23:15:44,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-08 23:15:44,729 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 84 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:44,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 260 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:15:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-08 23:15:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 274. [2024-11-08 23:15:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 180 states have (on average 1.1166666666666667) internal successors, (201), 183 states have internal predecessors, (201), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-08 23:15:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 345 transitions. [2024-11-08 23:15:44,756 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 345 transitions. Word has length 119 [2024-11-08 23:15:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:44,757 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 345 transitions. [2024-11-08 23:15:44,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 345 transitions. [2024-11-08 23:15:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:15:44,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:44,758 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:44,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:15:44,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:44,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1641860466, now seen corresponding path program 1 times [2024-11-08 23:15:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919328349] [2024-11-08 23:15:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:44,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:44,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919328349] [2024-11-08 23:15:44,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919328349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:44,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:44,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:15:44,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801380019] [2024-11-08 23:15:44,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:44,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:15:44,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:44,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:15:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:15:44,848 INFO L87 Difference]: Start difference. First operand 274 states and 345 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:44,907 INFO L93 Difference]: Finished difference Result 525 states and 658 transitions. [2024-11-08 23:15:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:15:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-08 23:15:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:44,911 INFO L225 Difference]: With dead ends: 525 [2024-11-08 23:15:44,912 INFO L226 Difference]: Without dead ends: 274 [2024-11-08 23:15:44,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-08 23:15:44,913 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:44,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:15:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-08 23:15:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-08 23:15:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 180 states have (on average 1.1) internal successors, (198), 183 states have internal predecessors, (198), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-08 23:15:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2024-11-08 23:15:44,952 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 120 [2024-11-08 23:15:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:44,952 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2024-11-08 23:15:44,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2024-11-08 23:15:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 23:15:44,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:44,954 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:44,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:15:44,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:44,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash 599365845, now seen corresponding path program 1 times [2024-11-08 23:15:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:44,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77315376] [2024-11-08 23:15:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:44,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:44,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:45,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:45,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77315376] [2024-11-08 23:15:45,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77315376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:45,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:45,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:15:45,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912731536] [2024-11-08 23:15:45,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:45,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:15:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:45,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:15:45,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:15:45,006 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:45,054 INFO L93 Difference]: Finished difference Result 655 states and 810 transitions. [2024-11-08 23:15:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:15:45,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-08 23:15:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:45,057 INFO L225 Difference]: With dead ends: 655 [2024-11-08 23:15:45,057 INFO L226 Difference]: Without dead ends: 404 [2024-11-08 23:15:45,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-08 23:15:45,059 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:45,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 161 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:15:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-08 23:15:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 342. [2024-11-08 23:15:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 224 states have (on average 1.0892857142857142) internal successors, (244), 228 states have internal predecessors, (244), 90 states have call successors, (90), 27 states have call predecessors, (90), 27 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 23:15:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 424 transitions. [2024-11-08 23:15:45,090 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 424 transitions. Word has length 123 [2024-11-08 23:15:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:45,091 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 424 transitions. [2024-11-08 23:15:45,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 424 transitions. [2024-11-08 23:15:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 23:15:45,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:45,092 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:45,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 23:15:45,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:45,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1588499968, now seen corresponding path program 1 times [2024-11-08 23:15:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:45,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158094270] [2024-11-08 23:15:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158094270] [2024-11-08 23:15:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158094270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:45,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:45,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:15:45,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023715237] [2024-11-08 23:15:45,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:45,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:15:45,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:45,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:15:45,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:15:45,163 INFO L87 Difference]: Start difference. First operand 342 states and 424 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:15:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:45,257 INFO L93 Difference]: Finished difference Result 525 states and 648 transitions. [2024-11-08 23:15:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:15:45,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 123 [2024-11-08 23:15:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:45,260 INFO L225 Difference]: With dead ends: 525 [2024-11-08 23:15:45,260 INFO L226 Difference]: Without dead ends: 341 [2024-11-08 23:15:45,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-08 23:15:45,261 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 62 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:45,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 114 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:15:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-08 23:15:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-11-08 23:15:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 223 states have (on average 1.0807174887892377) internal successors, (241), 227 states have internal predecessors, (241), 90 states have call successors, (90), 27 states have call predecessors, (90), 27 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 23:15:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 421 transitions. [2024-11-08 23:15:45,294 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 421 transitions. Word has length 123 [2024-11-08 23:15:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:45,294 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 421 transitions. [2024-11-08 23:15:45,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:15:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 421 transitions. [2024-11-08 23:15:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 23:15:45,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:45,296 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:45,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 23:15:45,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:45,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1016670393, now seen corresponding path program 1 times [2024-11-08 23:15:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:45,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157755992] [2024-11-08 23:15:45,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:45,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 33 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-11-08 23:15:46,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157755992] [2024-11-08 23:15:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157755992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:15:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564493765] [2024-11-08 23:15:46,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:46,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:46,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:46,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:15:46,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:15:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:46,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 23:15:46,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:15:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 480 proven. 33 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-08 23:15:47,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:15:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-08 23:15:48,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564493765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:15:48,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:15:48,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 17] total 42 [2024-11-08 23:15:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353399790] [2024-11-08 23:15:48,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:15:48,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-08 23:15:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-08 23:15:48,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 23:15:48,031 INFO L87 Difference]: Start difference. First operand 341 states and 421 transitions. Second operand has 42 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 42 states have internal predecessors, (109), 9 states have call successors, (42), 5 states have call predecessors, (42), 11 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2024-11-08 23:15:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:49,088 INFO L93 Difference]: Finished difference Result 389 states and 468 transitions. [2024-11-08 23:15:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 23:15:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 42 states have internal predecessors, (109), 9 states have call successors, (42), 5 states have call predecessors, (42), 11 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 123 [2024-11-08 23:15:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:49,090 INFO L225 Difference]: With dead ends: 389 [2024-11-08 23:15:49,091 INFO L226 Difference]: Without dead ends: 387 [2024-11-08 23:15:49,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=679, Invalid=2513, Unknown=0, NotChecked=0, Total=3192 [2024-11-08 23:15:49,092 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 221 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:49,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 454 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:15:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-08 23:15:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 347. [2024-11-08 23:15:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 232 states have (on average 1.0732758620689655) internal successors, (249), 236 states have internal predecessors, (249), 85 states have call successors, (85), 29 states have call predecessors, (85), 29 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-08 23:15:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 419 transitions. [2024-11-08 23:15:49,128 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 419 transitions. Word has length 123 [2024-11-08 23:15:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:49,128 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 419 transitions. [2024-11-08 23:15:49,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 42 states have internal predecessors, (109), 9 states have call successors, (42), 5 states have call predecessors, (42), 11 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2024-11-08 23:15:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 419 transitions. [2024-11-08 23:15:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 23:15:49,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:49,129 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:49,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:15:49,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:49,334 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:49,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:49,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1244896759, now seen corresponding path program 1 times [2024-11-08 23:15:49,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:49,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633150414] [2024-11-08 23:15:49,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:49,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 23:15:49,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:49,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633150414] [2024-11-08 23:15:49,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633150414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:15:49,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850970479] [2024-11-08 23:15:49,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:49,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:49,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:49,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:15:49,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 23:15:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:49,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:15:49,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:15:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 323 proven. 24 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-08 23:15:49,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:15:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 23:15:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850970479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:15:49,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:15:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2024-11-08 23:15:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339529744] [2024-11-08 23:15:49,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:15:49,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 23:15:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:49,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 23:15:49,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:15:49,908 INFO L87 Difference]: Start difference. First operand 347 states and 419 transitions. Second operand has 17 states, 16 states have (on average 5.5) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-08 23:15:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:50,769 INFO L93 Difference]: Finished difference Result 1017 states and 1218 transitions. [2024-11-08 23:15:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 23:15:50,770 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.5) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) Word has length 124 [2024-11-08 23:15:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:50,773 INFO L225 Difference]: With dead ends: 1017 [2024-11-08 23:15:50,773 INFO L226 Difference]: Without dead ends: 693 [2024-11-08 23:15:50,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 23:15:50,775 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 308 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:50,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 714 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:15:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-08 23:15:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 316. [2024-11-08 23:15:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 213 states have (on average 1.0704225352112675) internal successors, (228), 216 states have internal predecessors, (228), 75 states have call successors, (75), 27 states have call predecessors, (75), 27 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-08 23:15:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 378 transitions. [2024-11-08 23:15:50,822 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 378 transitions. Word has length 124 [2024-11-08 23:15:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:50,823 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 378 transitions. [2024-11-08 23:15:50,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.5) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-08 23:15:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 378 transitions. [2024-11-08 23:15:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 23:15:50,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:50,824 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:50,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 23:15:51,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:51,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:51,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash 197587415, now seen corresponding path program 1 times [2024-11-08 23:15:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:51,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357475631] [2024-11-08 23:15:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:15:51,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:51,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357475631] [2024-11-08 23:15:51,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357475631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:15:51,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:15:51,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:15:51,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888643658] [2024-11-08 23:15:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:15:51,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:15:51,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:51,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:15:51,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:15:51,075 INFO L87 Difference]: Start difference. First operand 316 states and 378 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:51,137 INFO L93 Difference]: Finished difference Result 686 states and 817 transitions. [2024-11-08 23:15:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:15:51,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-08 23:15:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:51,140 INFO L225 Difference]: With dead ends: 686 [2024-11-08 23:15:51,140 INFO L226 Difference]: Without dead ends: 403 [2024-11-08 23:15:51,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-08 23:15:51,141 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:51,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 209 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:15:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-08 23:15:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 287. [2024-11-08 23:15:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 197 states have (on average 1.0659898477157361) internal successors, (210), 199 states have internal predecessors, (210), 65 states have call successors, (65), 24 states have call predecessors, (65), 24 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 23:15:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 340 transitions. [2024-11-08 23:15:51,174 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 340 transitions. Word has length 124 [2024-11-08 23:15:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:51,174 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 340 transitions. [2024-11-08 23:15:51,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:15:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 340 transitions. [2024-11-08 23:15:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:15:51,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:51,177 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:51,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 23:15:51,177 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:51,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:51,177 INFO L85 PathProgramCache]: Analyzing trace with hash -239012709, now seen corresponding path program 1 times [2024-11-08 23:15:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:51,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858692377] [2024-11-08 23:15:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:15:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:15:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:15:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:15:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:15:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:15:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:15:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:15:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:15:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:15:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:15:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:15:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:15:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:15:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:15:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:15:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:15:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:15:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-08 23:15:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:15:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858692377] [2024-11-08 23:15:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858692377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:15:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110539647] [2024-11-08 23:15:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:51,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:15:51,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:51,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:15:51,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 23:15:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:15:52,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 23:15:52,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:15:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 378 proven. 33 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-08 23:15:52,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:15:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-08 23:15:53,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110539647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:15:53,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:15:53,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 15] total 35 [2024-11-08 23:15:53,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121998435] [2024-11-08 23:15:53,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:15:53,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 23:15:53,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:15:53,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 23:15:53,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 23:15:53,549 INFO L87 Difference]: Start difference. First operand 287 states and 340 transitions. Second operand has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 35 states have internal predecessors, (103), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-08 23:15:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:15:54,465 INFO L93 Difference]: Finished difference Result 495 states and 586 transitions. [2024-11-08 23:15:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 23:15:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 35 states have internal predecessors, (103), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 125 [2024-11-08 23:15:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:15:54,467 INFO L225 Difference]: With dead ends: 495 [2024-11-08 23:15:54,467 INFO L226 Difference]: Without dead ends: 333 [2024-11-08 23:15:54,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 264 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=533, Invalid=1723, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 23:15:54,469 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 143 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:15:54,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 661 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:15:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-08 23:15:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2024-11-08 23:15:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 205 states have (on average 1.0634146341463415) internal successors, (218), 207 states have internal predecessors, (218), 65 states have call successors, (65), 24 states have call predecessors, (65), 24 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 23:15:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 348 transitions. [2024-11-08 23:15:54,502 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 348 transitions. Word has length 125 [2024-11-08 23:15:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:15:54,502 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 348 transitions. [2024-11-08 23:15:54,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 35 states have internal predecessors, (103), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-08 23:15:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 348 transitions. [2024-11-08 23:15:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:15:54,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:15:54,503 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:54,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 23:15:54,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 23:15:54,704 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:15:54,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:15:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash 605084724, now seen corresponding path program 1 times [2024-11-08 23:15:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:15:54,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604212531] [2024-11-08 23:15:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:15:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:15:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:15:54,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:15:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:15:54,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:15:54,788 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:15:54,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:15:54,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 23:15:54,794 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:15:54,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:15:54,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:15:54 BoogieIcfgContainer [2024-11-08 23:15:54,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:15:54,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:15:54,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:15:54,868 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:15:54,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:34" (3/4) ... [2024-11-08 23:15:54,870 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:15:54,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:15:54,872 INFO L158 Benchmark]: Toolchain (without parser) took 21042.19ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 149.7MB in the beginning and 203.4MB in the end (delta: -53.7MB). Peak memory consumption was 306.7MB. Max. memory is 16.1GB. [2024-11-08 23:15:54,872 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:15:54,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.06ms. Allocated memory is still 178.3MB. Free memory was 149.7MB in the beginning and 135.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:15:54,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.47ms. Allocated memory is still 178.3MB. Free memory was 135.8MB in the beginning and 132.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:15:54,873 INFO L158 Benchmark]: Boogie Preprocessor took 39.26ms. Allocated memory is still 178.3MB. Free memory was 132.9MB in the beginning and 130.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:15:54,873 INFO L158 Benchmark]: RCFGBuilder took 389.32ms. Allocated memory is still 178.3MB. Free memory was 130.8MB in the beginning and 113.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:15:54,874 INFO L158 Benchmark]: TraceAbstraction took 20318.55ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 111.9MB in the beginning and 203.4MB in the end (delta: -91.5MB). Peak memory consumption was 269.0MB. Max. memory is 16.1GB. [2024-11-08 23:15:54,874 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 539.0MB. Free memory is still 203.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:15:54,875 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.06ms. Allocated memory is still 178.3MB. Free memory was 149.7MB in the beginning and 135.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.47ms. Allocated memory is still 178.3MB. Free memory was 135.8MB in the beginning and 132.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.26ms. Allocated memory is still 178.3MB. Free memory was 132.9MB in the beginning and 130.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.32ms. Allocated memory is still 178.3MB. Free memory was 130.8MB in the beginning and 113.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20318.55ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 111.9MB in the beginning and 203.4MB in the end (delta: -91.5MB). Peak memory consumption was 269.0MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 539.0MB. Free memory is still 203.4MB. 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 101, overapproximation of bitwiseOr at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed short int var_1_7 = 32; [L24] signed short int var_1_8 = 20113; [L25] signed short int var_1_9 = 100; [L26] signed char var_1_10 = 100; [L27] signed char var_1_11 = -1; [L28] signed char var_1_12 = 16; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 1; [L32] unsigned short int var_1_18 = 10; [L33] unsigned short int var_1_19 = 256; [L34] signed long int var_1_20 = 32; [L35] signed long int var_1_21 = 127; [L36] signed short int var_1_22 = 128; VAL [isInitial=0, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32, var_1_8=20113, var_1_9=100] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L72] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L73] var_1_8 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L75] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L76] var_1_9 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L78] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L79] var_1_11 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L82] var_1_12 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L88] var_1_16 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L91] var_1_19 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L94] var_1_21 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_21 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L95] RET assume_abort_if_not(var_1_21 >= -2147483648) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_21 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L96] RET assume_abort_if_not(var_1_21 <= 2147483647) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L40] var_1_18 = var_1_19 [L41] var_1_20 = var_1_21 [L42] var_1_22 = var_1_12 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L43] COND FALSE !(127.5f > var_1_20) [L46] var_1_13 = ((var_1_20 >= var_1_20) || var_1_15) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L48] COND FALSE !(var_1_18 == var_1_7) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L51] EXPR (32 * -25) | var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L51] COND FALSE !(((32 * -25) | var_1_22) >= var_1_11) [L57] COND TRUE \read(var_1_13) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L58] COND TRUE var_1_10 > var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L59] COND TRUE \read(var_1_13) [L60] var_1_1 = (var_1_7 - (var_1_8 - var_1_9)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101] EXPR (32 * -25) | var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101-L102] return (((((var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1))) && ((127.5f > var_1_20) ? (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))) : (var_1_13 == ((unsigned char) ((var_1_20 >= var_1_20) || var_1_15))))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((signed short int) var_1_12)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 16, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1779 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1677 mSDsluCounter, 4562 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3115 mSDsCounter, 751 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6676 IncrementalHoareTripleChecker+Invalid, 7427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 751 mSolverCounterUnsat, 1447 mSDtfsCounter, 6676 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1956 GetRequests, 1695 SyntacticMatches, 8 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3374 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=12, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 801 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2517 NumberOfCodeBlocks, 2517 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2970 ConstructedInterpolants, 0 QuantifiedInterpolants, 13083 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1382 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 14775/15300 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-08 23:15:54,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.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 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:15:56,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:15:56,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:15:56,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:15:56,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:15:56,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:15:56,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:15:56,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:15:56,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:15:56,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:15:56,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:15:56,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:15:56,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:15:56,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:15:56,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:15:56,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:15:56,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:15:56,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:15:56,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:15:56,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:15:56,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:15:56,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:15:56,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:15:56,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:15:56,983 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:15:56,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:15:56,983 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:15:56,984 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:15:56,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:15:56,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:15:56,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:15:56,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:15:56,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:15:56,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:15:56,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:15:56,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:15:56,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:15:56,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:15:56,986 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:15:56,986 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:15:56,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:15:56,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:15:56,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:15:56,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:15:56,987 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 -> 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 [2024-11-08 23:15:57,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:15:57,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:15:57,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:15:57,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:15:57,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:15:57,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-08 23:15:58,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:15:58,889 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:15:58,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-08 23:15:58,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b2edbd5/9e402d9b688d4ad6b065643b6c7ab917/FLAGe1b4f7129 [2024-11-08 23:15:59,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b2edbd5/9e402d9b688d4ad6b065643b6c7ab917 [2024-11-08 23:15:59,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:15:59,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:15:59,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:59,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:15:59,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:15:59,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f924a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59, skipping insertion in model container [2024-11-08 23:15:59,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:15:59,452 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2024-11-08 23:15:59,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:59,521 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:15:59,532 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_floatingpointinfluence_no-floats_file-97.i[916,929] [2024-11-08 23:15:59,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:15:59,578 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:15:59,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59 WrapperNode [2024-11-08 23:15:59,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:15:59,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:59,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:15:59,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:15:59,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,639 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-08 23:15:59,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:15:59,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:15:59,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:15:59,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:15:59,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,682 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:15:59,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:15:59,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:15:59,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:15:59,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:15:59,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (1/1) ... [2024-11-08 23:15:59,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:15:59,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:15:59,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:15:59,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:15:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:15:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:15:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:15:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:15:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:15:59,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:15:59,882 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:15:59,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:16:00,411 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 23:16:00,411 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:16:00,426 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:16:00,426 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:16:00,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:16:00 BoogieIcfgContainer [2024-11-08 23:16:00,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:16:00,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:16:00,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:16:00,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:16:00,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:15:59" (1/3) ... [2024-11-08 23:16:00,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4876cbd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:16:00, skipping insertion in model container [2024-11-08 23:16:00,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59" (2/3) ... [2024-11-08 23:16:00,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4876cbd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:16:00, skipping insertion in model container [2024-11-08 23:16:00,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:16:00" (3/3) ... [2024-11-08 23:16:00,435 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-08 23:16:00,450 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:16:00,450 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:16:00,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:16:00,524 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;@5cd02136, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:16:00,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:16:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:16:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:16:00,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:00,540 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:16:00,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 73183195, now seen corresponding path program 1 times [2024-11-08 23:16:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:16:00,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886021054] [2024-11-08 23:16:00,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:00,560 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-08 23:16:00,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:16:00,567 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-08 23:16:00,577 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-08 23:16:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:00,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:16:00,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:16:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-08 23:16:00,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:16:00,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:16:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886021054] [2024-11-08 23:16:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886021054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:16:00,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:16:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:16:00,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709493557] [2024-11-08 23:16:00,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:16:00,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:16:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:16:00,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:16:00,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:16:00,794 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:16:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:00,818 INFO L93 Difference]: Finished difference Result 99 states and 172 transitions. [2024-11-08 23:16:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:16:00,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2024-11-08 23:16:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:00,826 INFO L225 Difference]: With dead ends: 99 [2024-11-08 23:16:00,826 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 23:16:00,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:16:00,831 INFO L432 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:00,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:16:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 23:16:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 23:16:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:16:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-11-08 23:16:00,872 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 111 [2024-11-08 23:16:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:00,873 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-11-08 23:16:00,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 23:16:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-11-08 23:16:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:16:00,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:00,876 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:16:00,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:16:01,076 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-08 23:16:01,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:01,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash 753856795, now seen corresponding path program 1 times [2024-11-08 23:16:01,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:16:01,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254495708] [2024-11-08 23:16:01,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:01,078 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-08 23:16:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:16:01,083 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-08 23:16:01,084 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-08 23:16:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:01,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:16:01,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:16:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 23:16:01,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:16:01,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:16:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254495708] [2024-11-08 23:16:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254495708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:16:01,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:16:01,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:16:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297341015] [2024-11-08 23:16:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:16:01,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:16:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:16:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:16:01,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:16:01,300 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:16:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:01,590 INFO L93 Difference]: Finished difference Result 141 states and 213 transitions. [2024-11-08 23:16:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:16:01,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-11-08 23:16:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:01,593 INFO L225 Difference]: With dead ends: 141 [2024-11-08 23:16:01,593 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 23:16:01,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 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-08 23:16:01,595 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:01,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 136 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:16:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 23:16:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 55. [2024-11-08 23:16:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:16:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-11-08 23:16:01,606 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 111 [2024-11-08 23:16:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:01,607 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-11-08 23:16:01,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 23:16:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-11-08 23:16:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:16:01,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:01,609 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:16:01,618 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-08 23:16:01,810 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-08 23:16:01,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:01,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1021150567, now seen corresponding path program 1 times [2024-11-08 23:16:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:16:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372814666] [2024-11-08 23:16:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:01,812 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-08 23:16:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:16:01,820 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-08 23:16:01,821 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-08 23:16:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:01,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:16:01,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:16:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 348 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 23:16:02,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:16:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-08 23:16:02,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:16:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372814666] [2024-11-08 23:16:02,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372814666] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:16:02,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:16:02,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-08 23:16:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082112613] [2024-11-08 23:16:02,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:16:02,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 23:16:02,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:16:02,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 23:16:02,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:16:02,577 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-08 23:16:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:03,515 INFO L93 Difference]: Finished difference Result 139 states and 203 transitions. [2024-11-08 23:16:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 23:16:03,515 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2024-11-08 23:16:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:03,517 INFO L225 Difference]: With dead ends: 139 [2024-11-08 23:16:03,517 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 23:16:03,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2024-11-08 23:16:03,518 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 111 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:03,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 129 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:16:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 23:16:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2024-11-08 23:16:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:16:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-11-08 23:16:03,530 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 111 [2024-11-08 23:16:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:03,530 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-11-08 23:16:03,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-08 23:16:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-11-08 23:16:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 23:16:03,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:03,532 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:16:03,537 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-08 23:16:03,732 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-08 23:16:03,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:03,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:03,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1489236011, now seen corresponding path program 1 times [2024-11-08 23:16:03,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:16:03,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137734531] [2024-11-08 23:16:03,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:03,734 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-08 23:16:03,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:16:03,737 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-08 23:16:03,737 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-08 23:16:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:03,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 23:16:03,816 INFO L278 TraceCheckSpWp]: Computing forward predicates...