./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.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-43.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 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:09:46,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:09:46,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:09:46,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:09:46,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:09:47,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:09:47,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:09:47,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:09:47,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:09:47,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:09:47,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:09:47,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:09:47,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:09:47,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:09:47,023 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:09:47,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:09:47,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:09:47,024 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:09:47,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:09:47,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:09:47,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:09:47,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:09:47,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:09:47,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:09:47,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:09:47,030 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:09:47,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:09:47,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:09:47,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:09:47,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:09:47,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:09:47,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:09:47,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:09:47,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:09:47,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:09:47,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:09:47,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:09:47,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:09:47,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:09:47,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:09:47,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:09:47,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:09:47,035 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 -> 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 [2024-11-08 23:09:47,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:09:47,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:09:47,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:09:47,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:09:47,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:09:47,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-43.i [2024-11-08 23:09:48,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:09:49,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:09:49,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-08 23:09:49,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4263c4828/b2f2d6524eed4c11815b067f88dd19ba/FLAG6f99a7cae [2024-11-08 23:09:49,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4263c4828/b2f2d6524eed4c11815b067f88dd19ba [2024-11-08 23:09:49,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:09:49,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:09:49,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:09:49,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:09:49,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:09:49,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e301039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49, skipping insertion in model container [2024-11-08 23:09:49,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:09:49,275 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-43.i[916,929] [2024-11-08 23:09:49,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:09:49,327 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:09:49,339 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-43.i[916,929] [2024-11-08 23:09:49,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:09:49,383 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:09:49,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49 WrapperNode [2024-11-08 23:09:49,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:09:49,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:09:49,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:09:49,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:09:49,394 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:09:49" (1/1) ... [2024-11-08 23:09:49,402 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:09:49" (1/1) ... [2024-11-08 23:09:49,440 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-08 23:09:49,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:09:49,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:09:49,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:09:49,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:09:49,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,480 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:09:49,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:09:49,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:09:49,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:09:49,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:09:49,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (1/1) ... [2024-11-08 23:09:49,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:09:49,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:09:49,543 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:09:49,547 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:09:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:09:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:09:49,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:09:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:09:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:09:49,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:09:49,684 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:09:49,687 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:09:50,102 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 23:09:50,102 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:09:50,118 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:09:50,119 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:09:50,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:50 BoogieIcfgContainer [2024-11-08 23:09:50,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:09:50,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:09:50,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:09:50,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:09:50,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:09:49" (1/3) ... [2024-11-08 23:09:50,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f50c951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:50, skipping insertion in model container [2024-11-08 23:09:50,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:49" (2/3) ... [2024-11-08 23:09:50,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f50c951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:50, skipping insertion in model container [2024-11-08 23:09:50,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:50" (3/3) ... [2024-11-08 23:09:50,131 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-08 23:09:50,148 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:09:50,149 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:09:50,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:09:50,226 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;@2a710605, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:09:50,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:09:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:09:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:09:50,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:09:50,249 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:50,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:09:50,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:09:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2072237394, now seen corresponding path program 1 times [2024-11-08 23:09:50,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:09:50,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072717692] [2024-11-08 23:09:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:09:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:09:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:09:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:09:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:09:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:09:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:09:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:09:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:09:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:09:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:09:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:09:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:09:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:09:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:09:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:09:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:09:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:09:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:09:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:09:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:09:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:09:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:09:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:09:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:09:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:09:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:09:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072717692] [2024-11-08 23:09:50,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072717692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:09:50,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:09:50,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:09:50,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637475041] [2024-11-08 23:09:50,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:09:50,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:09:50,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:09:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:09:50,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:09:50,844 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:09:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:09:50,870 INFO L93 Difference]: Finished difference Result 155 states and 264 transitions. [2024-11-08 23:09:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:09:50,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2024-11-08 23:09:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:09:50,882 INFO L225 Difference]: With dead ends: 155 [2024-11-08 23:09:50,883 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 23:09:50,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:09:50,893 INFO L432 NwaCegarLoop]: 116 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, 116 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:09:50,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:09:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 23:09:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 23:09:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:09:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-08 23:09:50,955 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 153 [2024-11-08 23:09:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:09:50,956 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-08 23:09:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:09:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-08 23:09:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:09:50,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:09:50,960 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:50,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:09:50,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:09:50,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:09:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1480861010, now seen corresponding path program 1 times [2024-11-08 23:09:50,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:09:50,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272763039] [2024-11-08 23:09:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:09:50,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:09:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:09:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:09:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:09:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:09:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:09:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:09:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:09:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:09:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:09:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:09:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:09:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:09:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:09:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:09:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:09:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:09:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:09:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:09:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:09:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:09:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:09:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:09:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:09:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:09:53,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:09:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272763039] [2024-11-08 23:09:53,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272763039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:09:53,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:09:53,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:09:53,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563190796] [2024-11-08 23:09:53,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:09:53,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:09:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:09:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:09:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:09:53,644 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:09:54,041 INFO L93 Difference]: Finished difference Result 193 states and 283 transitions. [2024-11-08 23:09:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:09:54,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-08 23:09:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:09:54,045 INFO L225 Difference]: With dead ends: 193 [2024-11-08 23:09:54,045 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 23:09:54,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:09:54,049 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 79 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:09:54,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 413 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:09:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 23:09:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 80. [2024-11-08 23:09:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:09:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2024-11-08 23:09:54,065 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 153 [2024-11-08 23:09:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:09:54,071 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 119 transitions. [2024-11-08 23:09:54,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions. [2024-11-08 23:09:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:09:54,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:09:54,076 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:54,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:09:54,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:09:54,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:09:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash -248710738, now seen corresponding path program 1 times [2024-11-08 23:09:54,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:09:54,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974010240] [2024-11-08 23:09:54,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:09:54,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:09:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:09:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:09:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:09:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:09:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:09:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:09:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:09:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:09:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:09:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:09:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:09:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:09:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:09:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:09:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:09:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:09:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:09:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:09:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:09:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:09:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:09:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:09:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:09:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:09:56,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:09:56,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974010240] [2024-11-08 23:09:56,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974010240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:09:56,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:09:56,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:09:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588977663] [2024-11-08 23:09:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:09:56,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:09:56,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:09:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:09:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:09:56,142 INFO L87 Difference]: Start difference. First operand 80 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:09:56,341 INFO L93 Difference]: Finished difference Result 180 states and 263 transitions. [2024-11-08 23:09:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:09:56,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-08 23:09:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:09:56,343 INFO L225 Difference]: With dead ends: 180 [2024-11-08 23:09:56,344 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 23:09:56,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:09:56,345 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 53 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:09:56,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 415 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:09:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 23:09:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2024-11-08 23:09:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:09:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-08 23:09:56,354 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 153 [2024-11-08 23:09:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:09:56,355 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-08 23:09:56,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-08 23:09:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:09:56,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:09:56,361 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:56,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:09:56,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:09:56,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:09:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2003628873, now seen corresponding path program 1 times [2024-11-08 23:09:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:09:56,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492808084] [2024-11-08 23:09:56,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:09:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:09:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:09:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:09:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:09:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:09:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:09:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:09:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:09:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:09:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:09:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:09:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:09:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:09:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:09:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:09:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:09:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:09:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:09:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:09:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:09:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:09:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:09:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:09:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:09:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:09:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:09:56,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492808084] [2024-11-08 23:09:56,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492808084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:09:56,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:09:56,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:09:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011653972] [2024-11-08 23:09:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:09:56,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:09:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:09:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:09:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:09:56,669 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:09:56,895 INFO L93 Difference]: Finished difference Result 201 states and 299 transitions. [2024-11-08 23:09:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:09:56,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-08 23:09:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:09:56,898 INFO L225 Difference]: With dead ends: 201 [2024-11-08 23:09:56,898 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 23:09:56,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:09:56,904 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 65 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:09:56,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 583 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:09:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 23:09:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2024-11-08 23:09:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 88 states have internal predecessors, (116), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 23:09:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-11-08 23:09:56,920 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 155 [2024-11-08 23:09:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:09:56,921 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-11-08 23:09:56,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-11-08 23:09:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:09:56,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:09:56,923 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:56,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:09:56,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:09:56,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:09:56,924 INFO L85 PathProgramCache]: Analyzing trace with hash -38969816, now seen corresponding path program 1 times [2024-11-08 23:09:56,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:09:56,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514546515] [2024-11-08 23:09:56,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:09:56,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:09:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:09:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:09:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:09:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:09:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:09:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:09:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:09:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:09:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:09:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:09:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:09:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:09:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:09:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:09:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:09:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:09:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:09:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:09:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:09:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:09:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:09:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:09:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:09:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:09:57,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:09:57,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514546515] [2024-11-08 23:09:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514546515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:09:57,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:09:57,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:09:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226091396] [2024-11-08 23:09:57,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:09:57,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:09:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:09:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:09:57,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:09:57,304 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:09:57,394 INFO L93 Difference]: Finished difference Result 303 states and 450 transitions. [2024-11-08 23:09:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:09:57,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2024-11-08 23:09:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:09:57,398 INFO L225 Difference]: With dead ends: 303 [2024-11-08 23:09:57,398 INFO L226 Difference]: Without dead ends: 182 [2024-11-08 23:09:57,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:09:57,399 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 74 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:09:57,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 655 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:09:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-08 23:09:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2024-11-08 23:09:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 125 states have (on average 1.328) internal successors, (166), 127 states have internal predecessors, (166), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:09:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2024-11-08 23:09:57,416 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 156 [2024-11-08 23:09:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:09:57,417 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2024-11-08 23:09:57,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2024-11-08 23:09:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:09:57,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:09:57,419 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:57,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:09:57,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:09:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:09:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 436989747, now seen corresponding path program 1 times [2024-11-08 23:09:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:09:57,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252912345] [2024-11-08 23:09:57,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:09:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:09:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:09:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:09:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:09:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:09:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:09:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:09:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:09:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:09:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:09:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:09:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:09:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:09:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:09:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:09:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:09:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:09:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:09:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:09:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:09:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:09:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:09:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:09:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:09:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:09:57,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:09:57,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252912345] [2024-11-08 23:09:57,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252912345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:09:57,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:09:57,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:09:57,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815016045] [2024-11-08 23:09:57,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:09:57,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:09:57,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:09:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:09:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:09:57,531 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:09:57,573 INFO L93 Difference]: Finished difference Result 441 states and 648 transitions. [2024-11-08 23:09:57,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:09:57,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2024-11-08 23:09:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:09:57,576 INFO L225 Difference]: With dead ends: 441 [2024-11-08 23:09:57,578 INFO L226 Difference]: Without dead ends: 265 [2024-11-08 23:09:57,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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:09:57,579 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 64 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:09:57,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 252 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:09:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-08 23:09:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 200. [2024-11-08 23:09:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 147 states have internal predecessors, (193), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:09:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 293 transitions. [2024-11-08 23:09:57,612 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 293 transitions. Word has length 156 [2024-11-08 23:09:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:09:57,613 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 293 transitions. [2024-11-08 23:09:57,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:09:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 293 transitions. [2024-11-08 23:09:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:09:57,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:09:57,615 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:57,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:09:57,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:09:57,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:09:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 222150276, now seen corresponding path program 1 times [2024-11-08 23:09:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:09:57,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807076351] [2024-11-08 23:09:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:09:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:09:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:09:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:09:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:09:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:09:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:09:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:09:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:09:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:09:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:09:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:09:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:09:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:09:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:09:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:09:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:09:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:09:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:09:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:09:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:09:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:09:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:09:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:09:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:09:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:09:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:09:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:09:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:09:59,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807076351] [2024-11-08 23:09:59,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807076351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:09:59,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:09:59,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 23:09:59,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268326437] [2024-11-08 23:09:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:09:59,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:09:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:09:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:09:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:09:59,630 INFO L87 Difference]: Start difference. First operand 200 states and 293 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:00,960 INFO L93 Difference]: Finished difference Result 680 states and 976 transitions. [2024-11-08 23:10:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 23:10:00,961 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-08 23:10:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:00,966 INFO L225 Difference]: With dead ends: 680 [2024-11-08 23:10:00,967 INFO L226 Difference]: Without dead ends: 483 [2024-11-08 23:10:00,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2024-11-08 23:10:00,969 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 425 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:00,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 833 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 23:10:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-08 23:10:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 395. [2024-11-08 23:10:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 291 states have (on average 1.309278350515464) internal successors, (381), 294 states have internal predecessors, (381), 94 states have call successors, (94), 9 states have call predecessors, (94), 9 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 23:10:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 569 transitions. [2024-11-08 23:10:01,032 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 569 transitions. Word has length 157 [2024-11-08 23:10:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:01,033 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 569 transitions. [2024-11-08 23:10:01,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 569 transitions. [2024-11-08 23:10:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:10:01,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:01,037 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:01,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:10:01,037 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:01,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash -798918078, now seen corresponding path program 1 times [2024-11-08 23:10:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871372704] [2024-11-08 23:10:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:10:02,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:02,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871372704] [2024-11-08 23:10:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871372704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:10:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:10:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 23:10:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427825040] [2024-11-08 23:10:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:10:02,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 23:10:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 23:10:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:10:02,579 INFO L87 Difference]: Start difference. First operand 395 states and 569 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:03,846 INFO L93 Difference]: Finished difference Result 515 states and 723 transitions. [2024-11-08 23:10:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 23:10:03,847 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-08 23:10:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:03,850 INFO L225 Difference]: With dead ends: 515 [2024-11-08 23:10:03,851 INFO L226 Difference]: Without dead ends: 513 [2024-11-08 23:10:03,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-11-08 23:10:03,852 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 248 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:03,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1137 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 23:10:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-08 23:10:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 419. [2024-11-08 23:10:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 303 states have (on average 1.297029702970297) internal successors, (393), 307 states have internal predecessors, (393), 104 states have call successors, (104), 11 states have call predecessors, (104), 11 states have return successors, (104), 100 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-08 23:10:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 601 transitions. [2024-11-08 23:10:03,908 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 601 transitions. Word has length 157 [2024-11-08 23:10:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:03,908 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 601 transitions. [2024-11-08 23:10:03,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 601 transitions. [2024-11-08 23:10:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:10:03,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:03,910 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:03,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:10:03,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:03,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1810035328, now seen corresponding path program 1 times [2024-11-08 23:10:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:03,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404154009] [2024-11-08 23:10:03,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:03,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:10:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:04,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404154009] [2024-11-08 23:10:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404154009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:10:04,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:10:04,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 23:10:04,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038179066] [2024-11-08 23:10:04,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:10:04,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:10:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:04,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:10:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:10:04,873 INFO L87 Difference]: Start difference. First operand 419 states and 601 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:05,896 INFO L93 Difference]: Finished difference Result 1066 states and 1496 transitions. [2024-11-08 23:10:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 23:10:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-08 23:10:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:05,905 INFO L225 Difference]: With dead ends: 1066 [2024-11-08 23:10:05,905 INFO L226 Difference]: Without dead ends: 869 [2024-11-08 23:10:05,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:10:05,907 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 272 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:05,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1170 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 23:10:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-08 23:10:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 629. [2024-11-08 23:10:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 475 states have (on average 1.2589473684210526) internal successors, (598), 481 states have internal predecessors, (598), 136 states have call successors, (136), 17 states have call predecessors, (136), 17 states have return successors, (136), 130 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-08 23:10:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 870 transitions. [2024-11-08 23:10:06,007 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 870 transitions. Word has length 157 [2024-11-08 23:10:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:06,008 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 870 transitions. [2024-11-08 23:10:06,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 870 transitions. [2024-11-08 23:10:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:10:06,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:06,014 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:06,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:10:06,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:06,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:06,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1372907198, now seen corresponding path program 1 times [2024-11-08 23:10:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:06,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303446516] [2024-11-08 23:10:06,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:10:06,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303446516] [2024-11-08 23:10:06,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303446516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:10:06,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:10:06,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:10:06,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850145193] [2024-11-08 23:10:06,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:10:06,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:10:06,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:06,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:10:06,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:10:06,929 INFO L87 Difference]: Start difference. First operand 629 states and 870 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:07,689 INFO L93 Difference]: Finished difference Result 714 states and 985 transitions. [2024-11-08 23:10:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 23:10:07,690 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-08 23:10:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:07,694 INFO L225 Difference]: With dead ends: 714 [2024-11-08 23:10:07,694 INFO L226 Difference]: Without dead ends: 712 [2024-11-08 23:10:07,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:10:07,696 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 168 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:07,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1039 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:10:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-08 23:10:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 577. [2024-11-08 23:10:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 423 states have (on average 1.2718676122931443) internal successors, (538), 429 states have internal predecessors, (538), 136 states have call successors, (136), 17 states have call predecessors, (136), 17 states have return successors, (136), 130 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-08 23:10:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 810 transitions. [2024-11-08 23:10:07,770 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 810 transitions. Word has length 157 [2024-11-08 23:10:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:07,771 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 810 transitions. [2024-11-08 23:10:07,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 810 transitions. [2024-11-08 23:10:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:10:07,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:07,774 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:07,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 23:10:07,774 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:07,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2059209339, now seen corresponding path program 1 times [2024-11-08 23:10:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:07,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562055999] [2024-11-08 23:10:07,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:07,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562055999] [2024-11-08 23:10:07,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562055999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:10:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920499925] [2024-11-08 23:10:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:07,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:10:07,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:10:07,976 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:10:07,977 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:10:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:08,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:10:08,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:10:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-08 23:10:08,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:10:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:08,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920499925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:10:08,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:10:08,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 23:10:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444674804] [2024-11-08 23:10:08,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:10:08,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:10:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:08,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:10:08,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:10:08,452 INFO L87 Difference]: Start difference. First operand 577 states and 810 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-08 23:10:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:08,646 INFO L93 Difference]: Finished difference Result 907 states and 1270 transitions. [2024-11-08 23:10:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:10:08,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 157 [2024-11-08 23:10:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:08,650 INFO L225 Difference]: With dead ends: 907 [2024-11-08 23:10:08,650 INFO L226 Difference]: Without dead ends: 372 [2024-11-08 23:10:08,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:10:08,652 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 107 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:08,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 174 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:10:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-08 23:10:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2024-11-08 23:10:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 253 states have (on average 1.2411067193675889) internal successors, (314), 256 states have internal predecessors, (314), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 23:10:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 502 transitions. [2024-11-08 23:10:08,693 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 502 transitions. Word has length 157 [2024-11-08 23:10:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:08,693 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 502 transitions. [2024-11-08 23:10:08,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-08 23:10:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 502 transitions. [2024-11-08 23:10:08,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 23:10:08,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:08,695 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:08,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:10:08,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 23:10:08,896 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:08,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash -7853572, now seen corresponding path program 1 times [2024-11-08 23:10:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425571448] [2024-11-08 23:10:08,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:08,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:09,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:09,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425571448] [2024-11-08 23:10:09,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425571448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:10:09,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322803772] [2024-11-08 23:10:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:09,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:10:09,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:10:09,132 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:10:09,133 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:10:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:09,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:10:09,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:10:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-08 23:10:09,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:10:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:09,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322803772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:10:09,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:10:09,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-08 23:10:09,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083347012] [2024-11-08 23:10:09,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:10:09,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 23:10:09,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:09,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 23:10:09,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:10:09,559 INFO L87 Difference]: Start difference. First operand 364 states and 502 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-08 23:10:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:09,862 INFO L93 Difference]: Finished difference Result 702 states and 967 transitions. [2024-11-08 23:10:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:10:09,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 158 [2024-11-08 23:10:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:09,866 INFO L225 Difference]: With dead ends: 702 [2024-11-08 23:10:09,866 INFO L226 Difference]: Without dead ends: 384 [2024-11-08 23:10:09,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:10:09,868 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 153 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:09,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 428 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:10:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-08 23:10:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 376. [2024-11-08 23:10:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 265 states have (on average 1.230188679245283) internal successors, (326), 268 states have internal predecessors, (326), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 23:10:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 514 transitions. [2024-11-08 23:10:09,921 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 514 transitions. Word has length 158 [2024-11-08 23:10:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:09,922 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 514 transitions. [2024-11-08 23:10:09,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-08 23:10:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 514 transitions. [2024-11-08 23:10:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 23:10:09,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:09,923 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,940 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:10:10,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 23:10:10,124 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:10,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:10,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1287717250, now seen corresponding path program 1 times [2024-11-08 23:10:10,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:10,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946244296] [2024-11-08 23:10:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:10,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:10,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946244296] [2024-11-08 23:10:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946244296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:10:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736557535] [2024-11-08 23:10:10,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:10,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:10:10,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:10:10,414 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:10:10,415 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:10:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:10,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 23:10:10,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:10:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-08 23:10:10,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:10:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:10,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736557535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:10:10,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:10:10,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-08 23:10:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620805339] [2024-11-08 23:10:10,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:10:10,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 23:10:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:10,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 23:10:10,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:10:10,886 INFO L87 Difference]: Start difference. First operand 376 states and 514 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-08 23:10:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:11,435 INFO L93 Difference]: Finished difference Result 938 states and 1258 transitions. [2024-11-08 23:10:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 23:10:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 158 [2024-11-08 23:10:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:11,440 INFO L225 Difference]: With dead ends: 938 [2024-11-08 23:10:11,440 INFO L226 Difference]: Without dead ends: 608 [2024-11-08 23:10:11,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2024-11-08 23:10:11,442 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 315 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:11,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 484 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:10:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-08 23:10:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 413. [2024-11-08 23:10:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 298 states have (on average 1.238255033557047) internal successors, (369), 301 states have internal predecessors, (369), 94 states have call successors, (94), 20 states have call predecessors, (94), 20 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 23:10:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2024-11-08 23:10:11,507 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 158 [2024-11-08 23:10:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:11,507 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2024-11-08 23:10:11,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-08 23:10:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2024-11-08 23:10:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 23:10:11,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:11,509 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:11,525 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:10:11,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:10:11,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:11,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -206242740, now seen corresponding path program 1 times [2024-11-08 23:10:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009434292] [2024-11-08 23:10:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:10:12,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009434292] [2024-11-08 23:10:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009434292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:10:12,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:10:12,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:10:12,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912672824] [2024-11-08 23:10:12,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:10:12,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:10:12,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:12,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:10:12,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:10:12,539 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:13,058 INFO L93 Difference]: Finished difference Result 544 states and 730 transitions. [2024-11-08 23:10:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 23:10:13,059 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-08 23:10:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:13,062 INFO L225 Difference]: With dead ends: 544 [2024-11-08 23:10:13,062 INFO L226 Difference]: Without dead ends: 542 [2024-11-08 23:10:13,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:10:13,063 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 168 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:13,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 843 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:10:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-08 23:10:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 512. [2024-11-08 23:10:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 379 states have (on average 1.2348284960422165) internal successors, (468), 384 states have internal predecessors, (468), 110 states have call successors, (110), 22 states have call predecessors, (110), 22 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 23:10:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 688 transitions. [2024-11-08 23:10:13,121 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 688 transitions. Word has length 159 [2024-11-08 23:10:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:13,122 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 688 transitions. [2024-11-08 23:10:13,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 688 transitions. [2024-11-08 23:10:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 23:10:13,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:13,123 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 23:10:13,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:13,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1631246954, now seen corresponding path program 1 times [2024-11-08 23:10:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862095968] [2024-11-08 23:10:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:13,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862095968] [2024-11-08 23:10:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862095968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:10:13,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089461630] [2024-11-08 23:10:13,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:13,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:10:13,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:10:13,322 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:10:13,323 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:10:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:13,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:10:13,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:10:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 695 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 23:10:13,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:10:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:13,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089461630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:10:13,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:10:13,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-08 23:10:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761570140] [2024-11-08 23:10:13,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:10:13,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 23:10:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:13,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 23:10:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:10:13,744 INFO L87 Difference]: Start difference. First operand 512 states and 688 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2024-11-08 23:10:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:14,107 INFO L93 Difference]: Finished difference Result 1000 states and 1332 transitions. [2024-11-08 23:10:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 23:10:14,108 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) Word has length 159 [2024-11-08 23:10:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:14,111 INFO L225 Difference]: With dead ends: 1000 [2024-11-08 23:10:14,111 INFO L226 Difference]: Without dead ends: 538 [2024-11-08 23:10:14,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-08 23:10:14,113 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 250 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:14,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 195 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:10:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-08 23:10:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 292. [2024-11-08 23:10:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.219298245614035) internal successors, (278), 230 states have internal predecessors, (278), 50 states have call successors, (50), 13 states have call predecessors, (50), 13 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:10:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 378 transitions. [2024-11-08 23:10:14,155 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 378 transitions. Word has length 159 [2024-11-08 23:10:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:14,155 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 378 transitions. [2024-11-08 23:10:14,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2024-11-08 23:10:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 378 transitions. [2024-11-08 23:10:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 23:10:14,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:14,157 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:14,175 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:10:14,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 23:10:14,358 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:14,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash 668717503, now seen corresponding path program 1 times [2024-11-08 23:10:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:14,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324912764] [2024-11-08 23:10:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:14,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:10:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:10:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:10:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:10:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:10:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:10:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:10:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:10:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:10:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:10:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:10:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:10:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:10:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:10:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:10:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:10:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:10:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:10:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:10:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:10:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:10:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:10:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:10:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:10:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:14,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:10:14,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324912764] [2024-11-08 23:10:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324912764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:10:14,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:10:14,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:10:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322780611] [2024-11-08 23:10:14,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:10:14,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:10:14,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:10:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:10:14,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:10:14,560 INFO L87 Difference]: Start difference. First operand 292 states and 378 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:14,873 INFO L93 Difference]: Finished difference Result 589 states and 760 transitions. [2024-11-08 23:10:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:10:14,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-11-08 23:10:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:14,876 INFO L225 Difference]: With dead ends: 589 [2024-11-08 23:10:14,876 INFO L226 Difference]: Without dead ends: 300 [2024-11-08 23:10:14,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:10:14,878 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 117 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:14,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:10:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-08 23:10:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2024-11-08 23:10:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.147186147186147) internal successors, (265), 233 states have internal predecessors, (265), 50 states have call successors, (50), 14 states have call predecessors, (50), 14 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 23:10:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 365 transitions. [2024-11-08 23:10:14,920 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 365 transitions. Word has length 160 [2024-11-08 23:10:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:14,920 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 365 transitions. [2024-11-08 23:10:14,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 365 transitions. [2024-11-08 23:10:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 23:10:14,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:14,922 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:14,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 23:10:14,922 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:14,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 81911489, now seen corresponding path program 1 times [2024-11-08 23:10:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:10:14,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147225541] [2024-11-08 23:10:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:10:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:10:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791223056] [2024-11-08 23:10:14,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:14,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:10:14,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:10:14,954 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:10:14,957 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:10:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:10:15,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:10:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:10:15,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:10:15,153 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:10:15,155 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:10:15,174 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:10:15,357 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,SelfDestructingSolverStorable16 [2024-11-08 23:10:15,360 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:10:15,471 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:10:15,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:10:15 BoogieIcfgContainer [2024-11-08 23:10:15,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:10:15,474 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:10:15,474 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:10:15,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:10:15,475 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:50" (3/4) ... [2024-11-08 23:10:15,478 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:10:15,479 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:10:15,479 INFO L158 Benchmark]: Toolchain (without parser) took 26438.57ms. Allocated memory was 161.5MB in the beginning and 597.7MB in the end (delta: 436.2MB). Free memory was 129.8MB in the beginning and 291.3MB in the end (delta: -161.5MB). Peak memory consumption was 274.7MB. Max. memory is 16.1GB. [2024-11-08 23:10:15,480 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 87.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:10:15,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.63ms. Allocated memory is still 161.5MB. Free memory was 129.8MB in the beginning and 115.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:10:15,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.19ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 112.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:10:15,481 INFO L158 Benchmark]: Boogie Preprocessor took 59.47ms. Allocated memory is still 161.5MB. Free memory was 112.3MB in the beginning and 108.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:10:15,481 INFO L158 Benchmark]: RCFGBuilder took 618.27ms. Allocated memory is still 161.5MB. Free memory was 108.1MB in the beginning and 87.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 23:10:15,482 INFO L158 Benchmark]: TraceAbstraction took 25351.39ms. Allocated memory was 161.5MB in the beginning and 597.7MB in the end (delta: 436.2MB). Free memory was 86.5MB in the beginning and 292.3MB in the end (delta: -205.8MB). Peak memory consumption was 230.7MB. Max. memory is 16.1GB. [2024-11-08 23:10:15,482 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 597.7MB. Free memory was 292.3MB in the beginning and 291.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:10:15,486 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.18ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 87.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.63ms. Allocated memory is still 161.5MB. Free memory was 129.8MB in the beginning and 115.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.19ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 112.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.47ms. Allocated memory is still 161.5MB. Free memory was 112.3MB in the beginning and 108.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 618.27ms. Allocated memory is still 161.5MB. Free memory was 108.1MB in the beginning and 87.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25351.39ms. Allocated memory was 161.5MB in the beginning and 597.7MB in the end (delta: 436.2MB). Free memory was 86.5MB in the beginning and 292.3MB in the end (delta: -205.8MB). Peak memory consumption was 230.7MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 597.7MB. Free memory was 292.3MB in the beginning and 291.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 112, overapproximation of bitwiseOr at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] signed long int var_1_2 = 4; [L24] signed long int var_1_3 = 64; [L25] signed long int var_1_4 = 64; [L26] signed long int var_1_5 = 0; [L27] signed short int var_1_7 = 10000; [L28] signed short int var_1_8 = 1; [L29] signed short int var_1_9 = 50; [L30] signed short int var_1_10 = 8; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 100; [L33] unsigned short int var_1_15 = 128; [L34] unsigned short int var_1_16 = 23647; [L35] unsigned short int var_1_17 = 32; [L36] signed char var_1_18 = 0; [L37] signed char var_1_19 = -50; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; VAL [isInitial=0, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=4, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] FCALL updateLastVariables() [L120] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L73] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L75] var_1_3 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L76] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L78] var_1_4 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L79] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L81] var_1_5 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L83] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L83] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L84] var_1_7 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L85] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L86] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L86] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L87] var_1_8 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L88] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L89] CALL assume_abort_if_not(var_1_8 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L89] RET assume_abort_if_not(var_1_8 <= 8192) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L90] var_1_9 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_9 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L92] RET assume_abort_if_not(var_1_9 <= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L93] var_1_10 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L95] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L96] var_1_14 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L97] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L98] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L99] var_1_16 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L100] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L101] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L102] var_1_19 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L103] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L104] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L106] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L107] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L120] RET updateVariables() [L121] CALL step() [L43] var_1_18 = var_1_19 [L44] var_1_20 = var_1_21 [L45] signed char stepLocal_1 = var_1_18; [L46] signed long int stepLocal_0 = var_1_9 / var_1_7; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=3, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L47] EXPR var_1_8 << var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_1=3, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L47] COND FALSE !(stepLocal_1 > (var_1_8 << var_1_10)) [L54] EXPR var_1_7 ^ var_1_18 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L54] signed long int stepLocal_2 = var_1_7 ^ var_1_18; [L55] COND TRUE var_1_14 >= stepLocal_2 [L56] var_1_15 = (var_1_14 + (var_1_16 - var_1_13)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L58] COND TRUE var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L59] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L69] var_1_17 = var_1_1 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112] EXPR var_1_8 << var_1_10 VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112] EXPR (((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112-L113] return ((((((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1)) && (var_1_17 == ((unsigned short int) var_1_1))) && (var_1_18 == ((signed char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2604 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2558 mSDsluCounter, 8925 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6834 mSDsCounter, 643 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5681 IncrementalHoareTripleChecker+Invalid, 6324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 643 mSolverCounterUnsat, 2091 mSDtfsCounter, 5681 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2249 GetRequests, 2066 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=629occurred in iteration=9, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 1184 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 3457 NumberOfCodeBlocks, 3457 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3745 ConstructedInterpolants, 0 QuantifiedInterpolants, 10046 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1394 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 25974/26496 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:10:15,559 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-43.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 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:10:17,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:10:17,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:10:17,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:10:17,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:10:17,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:10:17,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:10:17,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:10:17,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:10:17,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:10:17,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:10:17,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:10:17,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:10:17,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:10:17,790 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:10:17,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:10:17,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:10:17,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:10:17,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:10:17,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:10:17,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:10:17,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:10:17,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:10:17,794 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:10:17,794 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:10:17,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:10:17,795 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:10:17,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:10:17,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:10:17,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:10:17,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:10:17,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:10:17,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:10:17,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:10:17,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:10:17,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:10:17,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:10:17,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:10:17,798 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:10:17,799 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:10:17,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:10:17,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:10:17,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:10:17,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:10:17,800 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 -> 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 [2024-11-08 23:10:18,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:10:18,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:10:18,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:10:18,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:10:18,143 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:10:18,144 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-43.i [2024-11-08 23:10:19,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:10:19,934 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:10:19,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-08 23:10:19,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764aca9e8/e7744f6e6cc1430b90d54c411e723195/FLAGa02183b4d [2024-11-08 23:10:20,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764aca9e8/e7744f6e6cc1430b90d54c411e723195 [2024-11-08 23:10:20,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:10:20,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:10:20,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:10:20,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:10:20,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:10:20,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb804b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20, skipping insertion in model container [2024-11-08 23:10:20,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:10:20,499 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-43.i[916,929] [2024-11-08 23:10:20,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:10:20,580 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:10:20,610 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-43.i[916,929] [2024-11-08 23:10:20,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:10:20,669 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:10:20,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20 WrapperNode [2024-11-08 23:10:20,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:10:20,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:10:20,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:10:20,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:10:20,677 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:10:20" (1/1) ... [2024-11-08 23:10:20,686 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:10:20" (1/1) ... [2024-11-08 23:10:20,710 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-08 23:10:20,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:10:20,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:10:20,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:10:20,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:10:20,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,740 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:10:20,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:10:20,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:10:20,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:10:20,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:10:20,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (1/1) ... [2024-11-08 23:10:20,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:10:20,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:10:20,799 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:10:20,801 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:10:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:10:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:10:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:10:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:10:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:10:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:10:20,919 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:10:20,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:10:21,278 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:10:21,278 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:10:21,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:10:21,295 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:10:21,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:21 BoogieIcfgContainer [2024-11-08 23:10:21,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:10:21,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:10:21,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:10:21,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:10:21,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:10:20" (1/3) ... [2024-11-08 23:10:21,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d135a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:21, skipping insertion in model container [2024-11-08 23:10:21,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:20" (2/3) ... [2024-11-08 23:10:21,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d135a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:21, skipping insertion in model container [2024-11-08 23:10:21,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:21" (3/3) ... [2024-11-08 23:10:21,307 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-08 23:10:21,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:10:21,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:10:21,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:10:21,414 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;@6a08cced, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:10:21,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:10:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:10:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 23:10:21,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:21,436 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:21,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:21,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -791064050, now seen corresponding path program 1 times [2024-11-08 23:10:21,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:10:21,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284660253] [2024-11-08 23:10:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:21,455 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:10:21,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:10:21,458 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:10:21,460 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:10:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:21,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:10:21,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:10:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-08 23:10:21,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:10:21,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:10:21,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284660253] [2024-11-08 23:10:21,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284660253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:10:21,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:10:21,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:10:21,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547480967] [2024-11-08 23:10:21,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:10:21,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:10:21,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:10:21,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:10:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:10:21,805 INFO L87 Difference]: Start difference. First operand has 63 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:10:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:21,836 INFO L93 Difference]: Finished difference Result 119 states and 208 transitions. [2024-11-08 23:10:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:10:21,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 147 [2024-11-08 23:10:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:21,844 INFO L225 Difference]: With dead ends: 119 [2024-11-08 23:10:21,845 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 23:10:21,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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:10:21,850 INFO L432 NwaCegarLoop]: 88 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, 88 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:10:21,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:10:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 23:10:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 23:10:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:10:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-11-08 23:10:21,898 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 147 [2024-11-08 23:10:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:21,899 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-11-08 23:10:21,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:10:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-08 23:10:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 23:10:21,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:21,903 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:21,910 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:10:22,103 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:10:22,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:22,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1986199026, now seen corresponding path program 1 times [2024-11-08 23:10:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:10:22,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115051441] [2024-11-08 23:10:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:22,107 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:10:22,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:10:22,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:10:22,111 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:10:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:22,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:10:22,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:10:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:10:22,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:10:22,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:10:22,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115051441] [2024-11-08 23:10:22,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115051441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:10:22,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:10:22,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:10:22,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205650464] [2024-11-08 23:10:22,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:10:22,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:10:22,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:10:22,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:10:22,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:10:22,411 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:10:22,871 INFO L93 Difference]: Finished difference Result 123 states and 180 transitions. [2024-11-08 23:10:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:10:22,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 147 [2024-11-08 23:10:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:10:22,875 INFO L225 Difference]: With dead ends: 123 [2024-11-08 23:10:22,875 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 23:10:22,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:10:22,878 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 81 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:10:22,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 120 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:10:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 23:10:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-11-08 23:10:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:10:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2024-11-08 23:10:22,894 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 147 [2024-11-08 23:10:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:10:22,895 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2024-11-08 23:10:22,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:10:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2024-11-08 23:10:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 23:10:22,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:10:22,898 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,905 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 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:10:23,101 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:10:23,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:10:23,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:10:23,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1928940724, now seen corresponding path program 1 times [2024-11-08 23:10:23,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:10:23,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919486705] [2024-11-08 23:10:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:10:23,104 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:10:23,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:10:23,107 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:10:23,108 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:10:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:10:23,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 23:10:23,239 INFO L278 TraceCheckSpWp]: Computing forward predicates...