./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.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 c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:58:46,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:58:46,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:58:46,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:58:46,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:58:46,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:58:46,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:58:46,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:58:46,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:58:46,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:58:46,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:58:46,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:58:46,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:58:46,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:58:46,249 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:58:46,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:58:46,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:58:46,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:58:46,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:58:46,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:58:46,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:58:46,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:58:46,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:58:46,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:58:46,254 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:58:46,254 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:58:46,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:58:46,254 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:58:46,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:58:46,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:58:46,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:58:46,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:58:46,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:58:46,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:58:46,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:58:46,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:58:46,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:58:46,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:58:46,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:58:46,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:58:46,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:58:46,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:58:46,257 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 -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2024-11-22 00:58:46,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:58:46,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:58:46,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:58:46,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:58:46,479 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:58:46,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-22 00:58:47,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:58:47,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:58:47,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-22 00:58:47,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2f1cc5b/068025c4772445ce8df76033ef33c4f9/FLAG7d4d35a5c [2024-11-22 00:58:48,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2f1cc5b/068025c4772445ce8df76033ef33c4f9 [2024-11-22 00:58:48,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:58:48,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:58:48,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:58:48,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:58:48,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:58:48,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5678eb57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48, skipping insertion in model container [2024-11-22 00:58:48,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:58:48,448 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-22 00:58:48,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:58:48,500 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:58:48,509 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-22 00:58:48,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:58:48,542 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:58:48,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48 WrapperNode [2024-11-22 00:58:48,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:58:48,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:58:48,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:58:48,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:58:48,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,577 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-11-22 00:58:48,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:58:48,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:58:48,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:58:48,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:58:48,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,603 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-22 00:58:48,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:58:48,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:58:48,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:58:48,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:58:48,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (1/1) ... [2024-11-22 00:58:48,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:58:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:58:48,692 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-22 00:58:48,695 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-22 00:58:48,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:58:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 00:58:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 00:58:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 00:58:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 00:58:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 00:58:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 00:58:48,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 00:58:48,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:58:48,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:58:48,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 00:58:48,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:58:48,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:58:48,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:58:48,817 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:58:48,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:58:49,003 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-22 00:58:49,004 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:58:49,017 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:58:49,018 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-22 00:58:49,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:58:49 BoogieIcfgContainer [2024-11-22 00:58:49,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:58:49,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:58:49,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:58:49,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:58:49,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:58:48" (1/3) ... [2024-11-22 00:58:49,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a137fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:58:49, skipping insertion in model container [2024-11-22 00:58:49,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:48" (2/3) ... [2024-11-22 00:58:49,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a137fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:58:49, skipping insertion in model container [2024-11-22 00:58:49,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:58:49" (3/3) ... [2024-11-22 00:58:49,024 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-22 00:58:49,036 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:58:49,036 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 00:58:49,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:58:49,082 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;@21fe2702, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:58:49,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 00:58:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 00:58:49,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:49,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:58:49,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:49,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1672152255, now seen corresponding path program 1 times [2024-11-22 00:58:49,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:49,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513967046] [2024-11-22 00:58:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:58:49,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:49,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513967046] [2024-11-22 00:58:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513967046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:58:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:58:49,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:58:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829160188] [2024-11-22 00:58:49,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:58:49,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:58:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:49,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:58:49,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:58:49,318 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:49,348 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2024-11-22 00:58:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:58:49,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 00:58:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:49,357 INFO L225 Difference]: With dead ends: 72 [2024-11-22 00:58:49,358 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 00:58:49,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 00:58:49,364 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:49,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:58:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 00:58:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-22 00:58:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-22 00:58:49,395 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2024-11-22 00:58:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:49,395 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-22 00:58:49,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-22 00:58:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 00:58:49,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:49,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:58:49,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:58:49,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1194375668, now seen corresponding path program 1 times [2024-11-22 00:58:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:49,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340360679] [2024-11-22 00:58:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:58:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:49,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340360679] [2024-11-22 00:58:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340360679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:58:49,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265062676] [2024-11-22 00:58:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:49,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:49,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:58:49,507 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-22 00:58:49,508 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-22 00:58:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:49,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 00:58:49,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:58:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:58:49,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:58:49,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265062676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:58:49,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 00:58:49,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-22 00:58:49,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128367983] [2024-11-22 00:58:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:58:49,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:58:49,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:49,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:58:49,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:58:49,605 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:49,620 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-22 00:58:49,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:58:49,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 00:58:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:49,621 INFO L225 Difference]: With dead ends: 60 [2024-11-22 00:58:49,621 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 00:58:49,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:58:49,623 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:49,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:58:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 00:58:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-22 00:58:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-22 00:58:49,627 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2024-11-22 00:58:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:49,628 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-22 00:58:49,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-22 00:58:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 00:58:49,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:49,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:58:49,637 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-22 00:58:49,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:49,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:49,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash -85488010, now seen corresponding path program 1 times [2024-11-22 00:58:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014192579] [2024-11-22 00:58:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:58:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014192579] [2024-11-22 00:58:49,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014192579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:58:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465557570] [2024-11-22 00:58:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:49,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:49,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:58:49,954 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-22 00:58:49,955 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-22 00:58:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:50,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 00:58:50,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:58:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 00:58:50,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:58:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465557570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:58:50,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 00:58:50,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-11-22 00:58:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037972988] [2024-11-22 00:58:50,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:58:50,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:58:50,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:58:50,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:58:50,093 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:50,167 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2024-11-22 00:58:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 00:58:50,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 00:58:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:50,169 INFO L225 Difference]: With dead ends: 72 [2024-11-22 00:58:50,169 INFO L226 Difference]: Without dead ends: 45 [2024-11-22 00:58:50,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:58:50,171 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:50,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:58:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-22 00:58:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-11-22 00:58:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-11-22 00:58:50,175 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 25 [2024-11-22 00:58:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:50,175 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-22 00:58:50,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-11-22 00:58:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 00:58:50,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:50,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:58:50,183 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-22 00:58:50,377 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,SelfDestructingSolverStorable2 [2024-11-22 00:58:50,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:50,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash -26382666, now seen corresponding path program 1 times [2024-11-22 00:58:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:50,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072393997] [2024-11-22 00:58:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:58:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:50,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072393997] [2024-11-22 00:58:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072393997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:58:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506497223] [2024-11-22 00:58:50,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:50,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:50,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:58:50,456 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-22 00:58:50,457 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-22 00:58:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:50,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 00:58:50,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:58:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:58:50,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:58:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:58:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506497223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:58:50,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:58:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-22 00:58:50,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108716754] [2024-11-22 00:58:50,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:58:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 00:58:50,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:50,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 00:58:50,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:58:50,580 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:50,605 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-22 00:58:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:58:50,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 00:58:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:50,607 INFO L225 Difference]: With dead ends: 77 [2024-11-22 00:58:50,608 INFO L226 Difference]: Without dead ends: 44 [2024-11-22 00:58:50,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:58:50,609 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:50,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:58:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-22 00:58:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-22 00:58:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-11-22 00:58:50,618 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 25 [2024-11-22 00:58:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:50,618 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-11-22 00:58:50,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-11-22 00:58:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 00:58:50,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:50,619 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-22 00:58:50,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 00:58:50,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:50,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:50,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1034544144, now seen corresponding path program 2 times [2024-11-22 00:58:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:50,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980077439] [2024-11-22 00:58:50,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:58:50,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:50,841 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 00:58:50,845 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:58:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:58:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980077439] [2024-11-22 00:58:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980077439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:58:50,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:58:50,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 00:58:50,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411581308] [2024-11-22 00:58:50,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:58:50,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 00:58:50,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:50,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 00:58:50,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:58:50,986 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:51,095 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2024-11-22 00:58:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:58:51,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-22 00:58:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:51,097 INFO L225 Difference]: With dead ends: 132 [2024-11-22 00:58:51,098 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 00:58:51,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:58:51,099 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 53 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:51,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 188 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:58:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 00:58:51,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2024-11-22 00:58:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-11-22 00:58:51,105 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 31 [2024-11-22 00:58:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:51,105 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-11-22 00:58:51,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2024-11-22 00:58:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 00:58:51,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:51,106 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-22 00:58:51,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 00:58:51,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:51,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash -776378706, now seen corresponding path program 1 times [2024-11-22 00:58:51,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:51,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337803084] [2024-11-22 00:58:51,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:51,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:58:51,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:51,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337803084] [2024-11-22 00:58:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337803084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:58:51,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:58:51,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 00:58:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724469929] [2024-11-22 00:58:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:58:51,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 00:58:51,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 00:58:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:58:51,226 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:51,274 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2024-11-22 00:58:51,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:58:51,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-22 00:58:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:51,275 INFO L225 Difference]: With dead ends: 93 [2024-11-22 00:58:51,275 INFO L226 Difference]: Without dead ends: 91 [2024-11-22 00:58:51,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:58:51,276 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:51,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 145 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:58:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-22 00:58:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2024-11-22 00:58:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2024-11-22 00:58:51,281 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 31 [2024-11-22 00:58:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:51,281 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2024-11-22 00:58:51,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2024-11-22 00:58:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 00:58:51,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:51,282 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 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-22 00:58:51,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 00:58:51,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash -106803413, now seen corresponding path program 1 times [2024-11-22 00:58:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471122086] [2024-11-22 00:58:51,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:58:51,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:51,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471122086] [2024-11-22 00:58:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471122086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:58:51,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:58:51,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:58:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350394515] [2024-11-22 00:58:51,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:58:51,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:58:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:51,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:58:51,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:58:51,326 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:51,338 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2024-11-22 00:58:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:58:51,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-22 00:58:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:51,339 INFO L225 Difference]: With dead ends: 116 [2024-11-22 00:58:51,339 INFO L226 Difference]: Without dead ends: 85 [2024-11-22 00:58:51,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:58:51,340 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:51,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:58:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-22 00:58:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-22 00:58:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 84 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2024-11-22 00:58:51,346 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 33 [2024-11-22 00:58:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:51,346 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2024-11-22 00:58:51,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2024-11-22 00:58:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 00:58:51,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:51,350 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 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-22 00:58:51,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 00:58:51,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:51,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash -499830423, now seen corresponding path program 1 times [2024-11-22 00:58:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:51,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676573492] [2024-11-22 00:58:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:58:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676573492] [2024-11-22 00:58:51,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676573492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:58:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066748774] [2024-11-22 00:58:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:51,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:51,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:58:51,424 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-22 00:58:51,425 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-22 00:58:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:51,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 00:58:51,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:58:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:58:51,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:58:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:58:51,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066748774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:58:51,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:58:51,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-22 00:58:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527806259] [2024-11-22 00:58:51,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:58:51,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 00:58:51,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:51,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 00:58:51,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-22 00:58:51,578 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:51,603 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2024-11-22 00:58:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 00:58:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-22 00:58:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:51,605 INFO L225 Difference]: With dead ends: 165 [2024-11-22 00:58:51,605 INFO L226 Difference]: Without dead ends: 91 [2024-11-22 00:58:51,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-22 00:58:51,608 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:51,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 225 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:58:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-22 00:58:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-22 00:58:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 90 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2024-11-22 00:58:51,617 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 33 [2024-11-22 00:58:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:51,617 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-22 00:58:51,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2024-11-22 00:58:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 00:58:51,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:51,618 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 1, 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-22 00:58:51,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 00:58:51,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:51,819 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:51,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash 346162339, now seen corresponding path program 2 times [2024-11-22 00:58:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:51,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951618917] [2024-11-22 00:58:51,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:58:51,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:51,837 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 00:58:51,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:58:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:51,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:51,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951618917] [2024-11-22 00:58:51,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951618917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:58:51,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:58:51,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 00:58:51,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2606925] [2024-11-22 00:58:51,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:58:51,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 00:58:51,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:51,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 00:58:51,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:58:51,907 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:51,954 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2024-11-22 00:58:51,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 00:58:51,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-22 00:58:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:51,956 INFO L225 Difference]: With dead ends: 181 [2024-11-22 00:58:51,956 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 00:58:51,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 00:58:51,957 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:51,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 135 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:58:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 00:58:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2024-11-22 00:58:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.24) internal successors, (124), 100 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2024-11-22 00:58:51,967 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 39 [2024-11-22 00:58:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:51,968 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2024-11-22 00:58:51,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2024-11-22 00:58:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 00:58:51,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:51,969 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 1, 1, 1, 1, 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-22 00:58:51,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 00:58:51,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:51,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1159200651, now seen corresponding path program 1 times [2024-11-22 00:58:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:51,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368495014] [2024-11-22 00:58:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:52,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368495014] [2024-11-22 00:58:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368495014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:58:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651921665] [2024-11-22 00:58:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:58:52,067 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-22 00:58:52,068 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-22 00:58:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:52,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 00:58:52,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:58:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:52,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:58:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651921665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:58:52,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:58:52,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-22 00:58:52,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766203769] [2024-11-22 00:58:52,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:58:52,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 00:58:52,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:52,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 00:58:52,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:58:52,197 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:52,267 INFO L93 Difference]: Finished difference Result 226 states and 276 transitions. [2024-11-22 00:58:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 00:58:52,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-22 00:58:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:52,268 INFO L225 Difference]: With dead ends: 226 [2024-11-22 00:58:52,268 INFO L226 Difference]: Without dead ends: 163 [2024-11-22 00:58:52,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-22 00:58:52,269 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 74 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:52,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 158 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:58:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-22 00:58:52,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2024-11-22 00:58:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.213235294117647) internal successors, (165), 136 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2024-11-22 00:58:52,274 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 44 [2024-11-22 00:58:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:52,275 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2024-11-22 00:58:52,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2024-11-22 00:58:52,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 00:58:52,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:52,276 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 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-22 00:58:52,286 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-22 00:58:52,476 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,SelfDestructingSolverStorable9 [2024-11-22 00:58:52,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:52,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1026725283, now seen corresponding path program 2 times [2024-11-22 00:58:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:52,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014569866] [2024-11-22 00:58:52,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:58:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:52,499 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:58:52,499 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:58:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:52,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014569866] [2024-11-22 00:58:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014569866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:58:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651071350] [2024-11-22 00:58:52,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:58:52,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:58:52,659 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:58:52,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 00:58:52,737 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:58:52,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:58:52,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 00:58:52,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:58:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:52,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:58:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:52,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651071350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:58:52,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:58:52,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2024-11-22 00:58:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22031110] [2024-11-22 00:58:52,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:58:52,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 00:58:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:52,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 00:58:52,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-11-22 00:58:52,968 INFO L87 Difference]: Start difference. First operand 137 states and 165 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:53,544 INFO L93 Difference]: Finished difference Result 444 states and 565 transitions. [2024-11-22 00:58:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-22 00:58:53,544 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-22 00:58:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:53,546 INFO L225 Difference]: With dead ends: 444 [2024-11-22 00:58:53,547 INFO L226 Difference]: Without dead ends: 241 [2024-11-22 00:58:53,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2024-11-22 00:58:53,549 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 426 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:53,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 653 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 00:58:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-22 00:58:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 159. [2024-11-22 00:58:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.2215189873417722) internal successors, (193), 158 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2024-11-22 00:58:53,557 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 49 [2024-11-22 00:58:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:53,557 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2024-11-22 00:58:53,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2024-11-22 00:58:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 00:58:53,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:53,559 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 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-22 00:58:53,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 00:58:53,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:53,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:53,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash 15608033, now seen corresponding path program 1 times [2024-11-22 00:58:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:53,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460556033] [2024-11-22 00:58:53,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:53,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:53,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:58:53,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460556033] [2024-11-22 00:58:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460556033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:58:53,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662954251] [2024-11-22 00:58:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:53,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:53,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:58:53,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:58:53,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 00:58:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:58:53,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 00:58:53,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:58:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:54,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:58:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:58:54,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662954251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:58:54,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:58:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-22 00:58:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780967153] [2024-11-22 00:58:54,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:58:54,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 00:58:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:58:54,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 00:58:54,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2024-11-22 00:58:54,288 INFO L87 Difference]: Start difference. First operand 159 states and 193 transitions. Second operand has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:58:54,621 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2024-11-22 00:58:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 00:58:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-22 00:58:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:58:54,622 INFO L225 Difference]: With dead ends: 281 [2024-11-22 00:58:54,623 INFO L226 Difference]: Without dead ends: 279 [2024-11-22 00:58:54,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=919, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 00:58:54,623 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 268 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:58:54,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 397 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 00:58:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-22 00:58:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 181. [2024-11-22 00:58:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.2555555555555555) internal successors, (226), 180 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2024-11-22 00:58:54,629 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 49 [2024-11-22 00:58:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:58:54,630 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2024-11-22 00:58:54,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2024-11-22 00:58:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 00:58:54,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:54,631 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 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-22 00:58:54,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 00:58:54,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:58:54,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:54,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash 17455075, now seen corresponding path program 1 times [2024-11-22 00:58:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:58:54,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522324300] [2024-11-22 00:58:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:58:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:58:54,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 00:58:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:58:54,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 00:58:54,899 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 00:58:54,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 00:58:54,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 00:58:54,904 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:58:54,933 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 00:58:54,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:58:54 BoogieIcfgContainer [2024-11-22 00:58:54,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 00:58:54,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 00:58:54,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 00:58:54,936 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 00:58:54,937 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:58:49" (3/4) ... [2024-11-22 00:58:54,938 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 00:58:54,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 00:58:54,940 INFO L158 Benchmark]: Toolchain (without parser) took 6658.84ms. Allocated memory was 136.3MB in the beginning and 213.9MB in the end (delta: 77.6MB). Free memory was 83.3MB in the beginning and 115.4MB in the end (delta: -32.1MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-11-22 00:58:54,940 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 136.3MB. Free memory was 97.7MB in the beginning and 97.5MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:58:54,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.51ms. Allocated memory is still 136.3MB. Free memory was 83.0MB in the beginning and 69.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 00:58:54,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.73ms. Allocated memory is still 136.3MB. Free memory was 69.2MB in the beginning and 67.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:58:54,940 INFO L158 Benchmark]: Boogie Preprocessor took 39.79ms. Allocated memory is still 136.3MB. Free memory was 67.2MB in the beginning and 64.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:58:54,941 INFO L158 Benchmark]: RCFGBuilder took 397.98ms. Allocated memory is still 136.3MB. Free memory was 64.7MB in the beginning and 92.8MB in the end (delta: -28.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-11-22 00:58:54,941 INFO L158 Benchmark]: TraceAbstraction took 5916.34ms. Allocated memory was 136.3MB in the beginning and 213.9MB in the end (delta: 77.6MB). Free memory was 92.1MB in the beginning and 116.0MB in the end (delta: -23.9MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-11-22 00:58:54,941 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 213.9MB. Free memory was 116.0MB in the beginning and 115.4MB in the end (delta: 627.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:58:54,942 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.12ms. Allocated memory is still 136.3MB. Free memory was 97.7MB in the beginning and 97.5MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.51ms. Allocated memory is still 136.3MB. Free memory was 83.0MB in the beginning and 69.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.73ms. Allocated memory is still 136.3MB. Free memory was 69.2MB in the beginning and 67.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.79ms. Allocated memory is still 136.3MB. Free memory was 67.2MB in the beginning and 64.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 397.98ms. Allocated memory is still 136.3MB. Free memory was 64.7MB in the beginning and 92.8MB in the end (delta: -28.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5916.34ms. Allocated memory was 136.3MB in the beginning and 213.9MB in the end (delta: 77.6MB). Free memory was 92.1MB in the beginning and 116.0MB in the end (delta: -23.9MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 213.9MB. Free memory was 116.0MB in the beginning and 115.4MB in the end (delta: 627.0kB). 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: 16]: 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 strncpy at line 42. Possible FailurePath: [L86] char A [2 + 2 + 4 +1]; [L87] int i = 0; VAL [A={10:0}, i=0] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=1] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=2] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=3] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=4] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=5] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=6] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=7] [L87] COND FALSE !(i<2 + 2 + 4 -1) VAL [A={10:0}] [L90] A[2 + 2 + 4] = 0 [L91] CALL parse_expression_list (A) [L60] int start=0, i=-1, j=-1; [L61] char str2[2]; VAL [i=-1, start=0, str2={7:0}, str={10:0}] [L62] COND FALSE !(!str) VAL [i=-1, start=0, str2={7:0}, str={10:0}] [L64] i++ [L65] str[i] [L66] case 0: VAL [i=0, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=2, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={10:0}] [L67] (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={10:0}] [L67] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L68] str[start] [L66] case 0: [L69] j = i-1 VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L71] EXPR str[j] [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L66] case 0: [L73] CALL r_strncpy(str2, str+start, j-start+1) [L42] return strncpy(dest,src,n); [L73] RET r_strncpy(str2, str+start, j-start+1) [L74] CALL __VERIFIER_assert(j - start + 1 < 2) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 889 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 2410 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1915 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1566 IncrementalHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 495 mSDtfsCounter, 1566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 419 SyntacticMatches, 12 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=12, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 273 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 702 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 2063 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1215 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 540/653 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-22 00:58:54,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.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 c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:58:56,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:58:56,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 00:58:56,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:58:56,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:58:56,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:58:56,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:58:56,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:58:56,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:58:56,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:58:56,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:58:56,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:58:56,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:58:56,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:58:56,876 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:58:56,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:58:56,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:58:56,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:58:56,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:58:56,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:58:56,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:58:56,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:58:56,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:58:56,880 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 00:58:56,881 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 00:58:56,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:58:56,881 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 00:58:56,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:58:56,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:58:56,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:58:56,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:58:56,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:58:56,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:58:56,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:58:56,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:58:56,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:58:56,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:58:56,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:58:56,883 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 00:58:56,883 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 00:58:56,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:58:56,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:58:56,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:58:56,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:58:56,885 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 -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2024-11-22 00:58:57,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:58:57,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:58:57,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:58:57,184 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:58:57,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:58:57,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-22 00:58:58,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:58:58,705 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:58:58,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-22 00:58:58,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a922a52/e0ec59f81021482783d8bd7991eb96b0/FLAG2b318022f [2024-11-22 00:58:59,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a922a52/e0ec59f81021482783d8bd7991eb96b0 [2024-11-22 00:58:59,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:58:59,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:58:59,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:58:59,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:58:59,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:58:59,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2eb171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59, skipping insertion in model container [2024-11-22 00:58:59,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:58:59,253 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-22 00:58:59,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:58:59,310 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:58:59,321 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-22 00:58:59,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:58:59,361 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:58:59,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59 WrapperNode [2024-11-22 00:58:59,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:58:59,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:58:59,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:58:59,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:58:59,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,399 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-11-22 00:58:59,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:58:59,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:58:59,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:58:59,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:58:59,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,431 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-22 00:58:59,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:58:59,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:58:59,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:58:59,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:58:59,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (1/1) ... [2024-11-22 00:58:59,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:58:59,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:58:59,499 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-22 00:58:59,502 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-22 00:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 00:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 00:58:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 00:58:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 00:58:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 00:58:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 00:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 00:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:58:59,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 00:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 00:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 00:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:58:59,629 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:58:59,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:58:59,878 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-22 00:58:59,878 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:58:59,890 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:58:59,890 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-22 00:58:59,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:58:59 BoogieIcfgContainer [2024-11-22 00:58:59,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:58:59,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:58:59,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:58:59,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:58:59,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:58:59" (1/3) ... [2024-11-22 00:58:59,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591dc602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:58:59, skipping insertion in model container [2024-11-22 00:58:59,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:58:59" (2/3) ... [2024-11-22 00:58:59,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591dc602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:58:59, skipping insertion in model container [2024-11-22 00:58:59,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:58:59" (3/3) ... [2024-11-22 00:58:59,899 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-22 00:58:59,913 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:58:59,913 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 00:58:59,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:58:59,963 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;@140e0e40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:58:59,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 00:58:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:58:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 00:58:59,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:58:59,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:58:59,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:58:59,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:58:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1672152255, now seen corresponding path program 1 times [2024-11-22 00:58:59,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:58:59,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488505964] [2024-11-22 00:58:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:58:59,989 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-22 00:58:59,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:58:59,991 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-22 00:58:59,991 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-22 00:59:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:00,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 00:59:00,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:59:00,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:59:00,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:00,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488505964] [2024-11-22 00:59:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488505964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:59:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:59:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 00:59:00,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305733711] [2024-11-22 00:59:00,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:59:00,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:59:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:59:00,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:59:00,144 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:00,157 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-11-22 00:59:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:59:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 00:59:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:00,164 INFO L225 Difference]: With dead ends: 70 [2024-11-22 00:59:00,164 INFO L226 Difference]: Without dead ends: 32 [2024-11-22 00:59:00,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-22 00:59:00,168 INFO L432 NwaCegarLoop]: 49 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, 49 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-22 00:59:00,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:59:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-22 00:59:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-22 00:59:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-11-22 00:59:00,195 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 19 [2024-11-22 00:59:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:00,196 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-11-22 00:59:00,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-11-22 00:59:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 00:59:00,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:00,198 INFO L215 NwaCegarLoop]: trace histogram [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-22 00:59:00,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 00:59:00,398 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-22 00:59:00,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:00,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 573346102, now seen corresponding path program 1 times [2024-11-22 00:59:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:00,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808391346] [2024-11-22 00:59:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:00,400 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-22 00:59:00,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:00,402 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-22 00:59:00,402 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-22 00:59:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:00,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 00:59:00,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:59:00,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:59:00,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:00,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808391346] [2024-11-22 00:59:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808391346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:59:00,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:59:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:59:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183557541] [2024-11-22 00:59:00,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:59:00,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:59:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:00,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:59:00,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:59:00,522 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:00,539 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2024-11-22 00:59:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:59:00,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 00:59:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:00,541 INFO L225 Difference]: With dead ends: 62 [2024-11-22 00:59:00,541 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 00:59:00,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-22 00:59:00,542 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:00,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:59:00,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 00:59:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-22 00:59:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-22 00:59:00,546 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 23 [2024-11-22 00:59:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:00,547 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-22 00:59:00,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-22 00:59:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 00:59:00,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:00,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:59:00,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 00:59:00,748 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-22 00:59:00,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:00,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1194375668, now seen corresponding path program 1 times [2024-11-22 00:59:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:00,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799188326] [2024-11-22 00:59:00,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:00,750 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-22 00:59:00,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:00,751 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-22 00:59:00,752 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-22 00:59:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:00,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 00:59:00,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:59:00,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:59:00,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799188326] [2024-11-22 00:59:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799188326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:00,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-22 00:59:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870557343] [2024-11-22 00:59:00,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:00,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 00:59:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 00:59:00,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:59:00,873 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:00,931 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2024-11-22 00:59:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:59:00,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 00:59:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:00,934 INFO L225 Difference]: With dead ends: 67 [2024-11-22 00:59:00,934 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 00:59:00,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:59:00,935 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:00,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 188 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:59:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 00:59:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-22 00:59:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-22 00:59:00,944 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 25 [2024-11-22 00:59:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:00,944 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-22 00:59:00,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:00,945 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-22 00:59:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 00:59:00,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:00,946 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-22 00:59:00,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 00:59:01,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:59:01,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:01,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash 186214190, now seen corresponding path program 2 times [2024-11-22 00:59:01,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931092503] [2024-11-22 00:59:01,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:59:01,149 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-22 00:59:01,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:01,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 00:59:01,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 00:59:01,228 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 00:59:01,228 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:59:01,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 00:59:01,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:59:01,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:59:01,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:01,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931092503] [2024-11-22 00:59:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931092503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:59:01,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:59:01,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:59:01,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735927698] [2024-11-22 00:59:01,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:59:01,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:59:01,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:01,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:59:01,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:59:01,243 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:01,262 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-11-22 00:59:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:59:01,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-22 00:59:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:01,263 INFO L225 Difference]: With dead ends: 66 [2024-11-22 00:59:01,263 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 00:59:01,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-22 00:59:01,264 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:01,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:59:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 00:59:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 00:59:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-11-22 00:59:01,274 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 31 [2024-11-22 00:59:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:01,274 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-11-22 00:59:01,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-22 00:59:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 00:59:01,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:01,275 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-22 00:59:01,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 00:59:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:59:01,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:01,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1093649488, now seen corresponding path program 1 times [2024-11-22 00:59:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181958840] [2024-11-22 00:59:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:01,480 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-22 00:59:01,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:01,482 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 00:59:01,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 00:59:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:01,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 00:59:01,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:59:01,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:59:01,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:01,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181958840] [2024-11-22 00:59:01,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181958840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:01,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:01,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-22 00:59:01,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73079163] [2024-11-22 00:59:01,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:01,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 00:59:01,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:01,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 00:59:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-22 00:59:01,681 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:01,753 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2024-11-22 00:59:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 00:59:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-22 00:59:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:01,755 INFO L225 Difference]: With dead ends: 75 [2024-11-22 00:59:01,755 INFO L226 Difference]: Without dead ends: 46 [2024-11-22 00:59:01,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-22 00:59:01,756 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:01,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:59:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-22 00:59:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-22 00:59:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-22 00:59:01,769 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 31 [2024-11-22 00:59:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:01,769 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-22 00:59:01,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-22 00:59:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:59:01,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:01,770 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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-22 00:59:01,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 00:59:01,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:59:01,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:01,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2031315606, now seen corresponding path program 2 times [2024-11-22 00:59:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747578639] [2024-11-22 00:59:01,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:59:01,974 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-22 00:59:01,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:01,976 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 00:59:01,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 00:59:02,030 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 00:59:02,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:59:02,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 00:59:02,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:02,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:59:02,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:02,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747578639] [2024-11-22 00:59:02,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747578639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:59:02,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:59:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 00:59:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000958474] [2024-11-22 00:59:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:59:02,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 00:59:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 00:59:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:59:02,160 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:02,323 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2024-11-22 00:59:02,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 00:59:02,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-22 00:59:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:02,326 INFO L225 Difference]: With dead ends: 139 [2024-11-22 00:59:02,326 INFO L226 Difference]: Without dead ends: 107 [2024-11-22 00:59:02,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:59:02,327 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:02,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 223 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:59:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-22 00:59:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2024-11-22 00:59:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-22 00:59:02,338 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 37 [2024-11-22 00:59:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:02,339 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-22 00:59:02,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-22 00:59:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:59:02,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:02,340 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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-22 00:59:02,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 00:59:02,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-22 00:59:02,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:02,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1773150168, now seen corresponding path program 1 times [2024-11-22 00:59:02,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:02,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990532769] [2024-11-22 00:59:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:02,542 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-22 00:59:02,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:02,544 INFO L229 MonitoredProcess]: Starting monitored process 8 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-22 00:59:02,545 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 (8)] Waiting until timeout for monitored process [2024-11-22 00:59:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:02,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 00:59:02,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:02,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:59:02,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990532769] [2024-11-22 00:59:02,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990532769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:59:02,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:59:02,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 00:59:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959465583] [2024-11-22 00:59:02,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:59:02,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 00:59:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:02,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 00:59:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:59:02,667 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:02,764 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2024-11-22 00:59:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 00:59:02,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-22 00:59:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:02,765 INFO L225 Difference]: With dead ends: 143 [2024-11-22 00:59:02,765 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 00:59:02,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:59:02,766 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 58 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:02,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 144 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:59:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 00:59:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2024-11-22 00:59:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2024-11-22 00:59:02,772 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 37 [2024-11-22 00:59:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:02,772 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2024-11-22 00:59:02,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2024-11-22 00:59:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:59:02,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:02,773 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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-22 00:59:02,778 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 (8)] Forceful destruction successful, exit code 0 [2024-11-22 00:59:02,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-22 00:59:02,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:02,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1714044824, now seen corresponding path program 1 times [2024-11-22 00:59:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127721604] [2024-11-22 00:59:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:02,975 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-22 00:59:02,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:02,977 INFO L229 MonitoredProcess]: Starting monitored process 9 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-22 00:59:02,978 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 (9)] Waiting until timeout for monitored process [2024-11-22 00:59:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:03,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 00:59:03,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:03,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:59:03,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127721604] [2024-11-22 00:59:03,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127721604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:59:03,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:59:03,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:59:03,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451647597] [2024-11-22 00:59:03,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:59:03,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:59:03,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:03,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:59:03,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:59:03,122 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:03,212 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2024-11-22 00:59:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 00:59:03,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-22 00:59:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:03,213 INFO L225 Difference]: With dead ends: 145 [2024-11-22 00:59:03,213 INFO L226 Difference]: Without dead ends: 113 [2024-11-22 00:59:03,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:59:03,213 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:03,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 137 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:59:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-22 00:59:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2024-11-22 00:59:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2024-11-22 00:59:03,227 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 37 [2024-11-22 00:59:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:03,227 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2024-11-22 00:59:03,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2024-11-22 00:59:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 00:59:03,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:03,228 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 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-22 00:59:03,232 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 (9)] Forceful destruction successful, exit code 0 [2024-11-22 00:59:03,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-22 00:59:03,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:03,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1288644661, now seen corresponding path program 1 times [2024-11-22 00:59:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562285457] [2024-11-22 00:59:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:03,430 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-22 00:59:03,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:03,431 INFO L229 MonitoredProcess]: Starting monitored process 10 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-22 00:59:03,433 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 (10)] Waiting until timeout for monitored process [2024-11-22 00:59:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:03,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 00:59:03,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:03,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:03,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562285457] [2024-11-22 00:59:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562285457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:03,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:03,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-22 00:59:03,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591114333] [2024-11-22 00:59:03,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:03,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 00:59:03,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:03,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 00:59:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-22 00:59:03,743 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:04,551 INFO L93 Difference]: Finished difference Result 397 states and 537 transitions. [2024-11-22 00:59:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 00:59:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-22 00:59:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:04,554 INFO L225 Difference]: With dead ends: 397 [2024-11-22 00:59:04,554 INFO L226 Difference]: Without dead ends: 351 [2024-11-22 00:59:04,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2024-11-22 00:59:04,555 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 507 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:04,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 405 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 00:59:04,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-22 00:59:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 151. [2024-11-22 00:59:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.38) internal successors, (207), 150 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2024-11-22 00:59:04,584 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 40 [2024-11-22 00:59:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:04,585 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2024-11-22 00:59:04,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2024-11-22 00:59:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 00:59:04,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:04,587 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:59:04,594 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 (10)] Forceful destruction successful, exit code 0 [2024-11-22 00:59:04,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-22 00:59:04,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:04,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1588600624, now seen corresponding path program 1 times [2024-11-22 00:59:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:04,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971469791] [2024-11-22 00:59:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:04,789 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-22 00:59:04,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:04,790 INFO L229 MonitoredProcess]: Starting monitored process 11 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-22 00:59:04,790 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 (11)] Waiting until timeout for monitored process [2024-11-22 00:59:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:04,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 00:59:04,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:04,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:59:04,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971469791] [2024-11-22 00:59:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971469791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:59:04,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:59:04,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 00:59:04,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985554676] [2024-11-22 00:59:04,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:59:04,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 00:59:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:04,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 00:59:04,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:59:04,901 INFO L87 Difference]: Start difference. First operand 151 states and 207 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:04,973 INFO L93 Difference]: Finished difference Result 206 states and 277 transitions. [2024-11-22 00:59:04,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 00:59:04,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-22 00:59:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:04,974 INFO L225 Difference]: With dead ends: 206 [2024-11-22 00:59:04,974 INFO L226 Difference]: Without dead ends: 143 [2024-11-22 00:59:04,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 00:59:04,975 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:04,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 180 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:59:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-22 00:59:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2024-11-22 00:59:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.32) internal successors, (165), 125 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2024-11-22 00:59:04,981 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 165 transitions. Word has length 40 [2024-11-22 00:59:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:04,981 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 165 transitions. [2024-11-22 00:59:04,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2024-11-22 00:59:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 00:59:04,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:04,982 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 1, 1, 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-22 00:59:04,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-22 00:59:05,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-22 00:59:05,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1695274414, now seen corresponding path program 1 times [2024-11-22 00:59:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:05,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125412131] [2024-11-22 00:59:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:05,184 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-22 00:59:05,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:05,185 INFO L229 MonitoredProcess]: Starting monitored process 12 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-22 00:59:05,186 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 (12)] Waiting until timeout for monitored process [2024-11-22 00:59:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:05,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 00:59:05,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:05,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:05,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125412131] [2024-11-22 00:59:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125412131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:05,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-22 00:59:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788677505] [2024-11-22 00:59:05,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:05,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 00:59:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 00:59:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 00:59:05,357 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:05,570 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2024-11-22 00:59:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 00:59:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-22 00:59:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:05,573 INFO L225 Difference]: With dead ends: 244 [2024-11-22 00:59:05,573 INFO L226 Difference]: Without dead ends: 211 [2024-11-22 00:59:05,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-22 00:59:05,573 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 130 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:05,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 379 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:59:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-22 00:59:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2024-11-22 00:59:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 170 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 226 transitions. [2024-11-22 00:59:05,580 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 226 transitions. Word has length 42 [2024-11-22 00:59:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:05,580 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 226 transitions. [2024-11-22 00:59:05,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 226 transitions. [2024-11-22 00:59:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 00:59:05,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:05,586 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 1, 1, 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-22 00:59:05,590 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 (12)] Forceful destruction successful, exit code 0 [2024-11-22 00:59:05,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-22 00:59:05,786 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:05,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:05,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1378003632, now seen corresponding path program 1 times [2024-11-22 00:59:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:05,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176950413] [2024-11-22 00:59:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:05,787 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-22 00:59:05,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:05,789 INFO L229 MonitoredProcess]: Starting monitored process 13 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-22 00:59:05,790 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 (13)] Waiting until timeout for monitored process [2024-11-22 00:59:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:05,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 00:59:05,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:05,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:06,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176950413] [2024-11-22 00:59:06,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176950413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:06,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:06,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-22 00:59:06,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202234062] [2024-11-22 00:59:06,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:06,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 00:59:06,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:06,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 00:59:06,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 00:59:06,115 INFO L87 Difference]: Start difference. First operand 171 states and 226 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:07,268 INFO L93 Difference]: Finished difference Result 442 states and 591 transitions. [2024-11-22 00:59:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 00:59:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-22 00:59:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:07,270 INFO L225 Difference]: With dead ends: 442 [2024-11-22 00:59:07,270 INFO L226 Difference]: Without dead ends: 440 [2024-11-22 00:59:07,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-11-22 00:59:07,270 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 295 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:07,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 510 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 00:59:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-22 00:59:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 225. [2024-11-22 00:59:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3482142857142858) internal successors, (302), 224 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 302 transitions. [2024-11-22 00:59:07,284 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 302 transitions. Word has length 42 [2024-11-22 00:59:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:07,284 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 302 transitions. [2024-11-22 00:59:07,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 302 transitions. [2024-11-22 00:59:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-22 00:59:07,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:07,285 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:59:07,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-22 00:59:07,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-22 00:59:07,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash 208496234, now seen corresponding path program 2 times [2024-11-22 00:59:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:07,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038204821] [2024-11-22 00:59:07,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:59:07,489 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-22 00:59:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:07,490 INFO L229 MonitoredProcess]: Starting monitored process 14 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-22 00:59:07,492 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 (14)] Waiting until timeout for monitored process [2024-11-22 00:59:07,553 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 00:59:07,553 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:59:07,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 00:59:07,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-22 00:59:07,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:59:07,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:07,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038204821] [2024-11-22 00:59:07,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038204821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:59:07,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:59:07,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:59:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149839229] [2024-11-22 00:59:07,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:59:07,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:59:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:07,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:59:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:59:07,581 INFO L87 Difference]: Start difference. First operand 225 states and 302 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:07,643 INFO L93 Difference]: Finished difference Result 305 states and 403 transitions. [2024-11-22 00:59:07,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 00:59:07,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-22 00:59:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:07,645 INFO L225 Difference]: With dead ends: 305 [2024-11-22 00:59:07,645 INFO L226 Difference]: Without dead ends: 243 [2024-11-22 00:59:07,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:59:07,645 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:07,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:59:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-22 00:59:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 222. [2024-11-22 00:59:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.3484162895927603) internal successors, (298), 221 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 298 transitions. [2024-11-22 00:59:07,654 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 298 transitions. Word has length 47 [2024-11-22 00:59:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:07,654 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 298 transitions. [2024-11-22 00:59:07,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 298 transitions. [2024-11-22 00:59:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-22 00:59:07,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:07,655 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:59:07,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-22 00:59:07,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-22 00:59:07,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:07,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:07,856 INFO L85 PathProgramCache]: Analyzing trace with hash 267601578, now seen corresponding path program 1 times [2024-11-22 00:59:07,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:07,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99925537] [2024-11-22 00:59:07,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:07,856 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-22 00:59:07,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:07,858 INFO L229 MonitoredProcess]: Starting monitored process 15 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-22 00:59:07,858 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 (15)] Waiting until timeout for monitored process [2024-11-22 00:59:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:07,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 00:59:07,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:07,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:08,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:08,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99925537] [2024-11-22 00:59:08,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99925537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:08,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:08,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-22 00:59:08,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270847020] [2024-11-22 00:59:08,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 00:59:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:08,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 00:59:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-22 00:59:08,060 INFO L87 Difference]: Start difference. First operand 222 states and 298 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:08,487 INFO L93 Difference]: Finished difference Result 689 states and 907 transitions. [2024-11-22 00:59:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 00:59:08,487 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-22 00:59:08,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:08,489 INFO L225 Difference]: With dead ends: 689 [2024-11-22 00:59:08,489 INFO L226 Difference]: Without dead ends: 627 [2024-11-22 00:59:08,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2024-11-22 00:59:08,490 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 760 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:08,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 721 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 00:59:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-22 00:59:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 509. [2024-11-22 00:59:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.328740157480315) internal successors, (675), 508 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 675 transitions. [2024-11-22 00:59:08,506 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 675 transitions. Word has length 47 [2024-11-22 00:59:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:08,506 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 675 transitions. [2024-11-22 00:59:08,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 675 transitions. [2024-11-22 00:59:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-22 00:59:08,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:08,507 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 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-22 00:59:08,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-22 00:59:08,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-22 00:59:08,707 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash 100862541, now seen corresponding path program 1 times [2024-11-22 00:59:08,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:08,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854586837] [2024-11-22 00:59:08,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:08,708 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-22 00:59:08,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:08,711 INFO L229 MonitoredProcess]: Starting monitored process 16 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-22 00:59:08,711 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 (16)] Waiting until timeout for monitored process [2024-11-22 00:59:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:08,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 00:59:08,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-22 00:59:08,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-22 00:59:08,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:08,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854586837] [2024-11-22 00:59:08,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854586837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:08,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:08,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-22 00:59:08,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385886157] [2024-11-22 00:59:08,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:08,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 00:59:08,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:08,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 00:59:08,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 00:59:08,880 INFO L87 Difference]: Start difference. First operand 509 states and 675 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:09,035 INFO L93 Difference]: Finished difference Result 844 states and 1110 transitions. [2024-11-22 00:59:09,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 00:59:09,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-22 00:59:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:09,037 INFO L225 Difference]: With dead ends: 844 [2024-11-22 00:59:09,037 INFO L226 Difference]: Without dead ends: 478 [2024-11-22 00:59:09,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-22 00:59:09,038 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 105 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:09,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 358 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:59:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-22 00:59:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2024-11-22 00:59:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.302771855010661) internal successors, (611), 469 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 611 transitions. [2024-11-22 00:59:09,049 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 611 transitions. Word has length 47 [2024-11-22 00:59:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:09,049 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 611 transitions. [2024-11-22 00:59:09,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 611 transitions. [2024-11-22 00:59:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-22 00:59:09,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:09,050 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 1, 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-22 00:59:09,054 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 (16)] Forceful destruction successful, exit code 0 [2024-11-22 00:59:09,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-22 00:59:09,251 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 734702770, now seen corresponding path program 1 times [2024-11-22 00:59:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697077155] [2024-11-22 00:59:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:09,251 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-22 00:59:09,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:09,254 INFO L229 MonitoredProcess]: Starting monitored process 17 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-22 00:59:09,254 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 (17)] Waiting until timeout for monitored process [2024-11-22 00:59:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:09,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 00:59:09,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:09,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:09,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:09,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697077155] [2024-11-22 00:59:09,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697077155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:09,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:09,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 00:59:09,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062429065] [2024-11-22 00:59:09,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:09,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 00:59:09,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:09,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 00:59:09,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-22 00:59:09,638 INFO L87 Difference]: Start difference. First operand 470 states and 611 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:10,807 INFO L93 Difference]: Finished difference Result 1092 states and 1416 transitions. [2024-11-22 00:59:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 00:59:10,808 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-22 00:59:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:10,810 INFO L225 Difference]: With dead ends: 1092 [2024-11-22 00:59:10,810 INFO L226 Difference]: Without dead ends: 719 [2024-11-22 00:59:10,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-11-22 00:59:10,812 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 412 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:10,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 647 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 00:59:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-22 00:59:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 524. [2024-11-22 00:59:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.311663479923518) internal successors, (686), 523 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 686 transitions. [2024-11-22 00:59:10,826 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 686 transitions. Word has length 48 [2024-11-22 00:59:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:10,826 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 686 transitions. [2024-11-22 00:59:10,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 686 transitions. [2024-11-22 00:59:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 00:59:10,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:10,827 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 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-22 00:59:10,831 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 (17)] Forceful destruction successful, exit code 0 [2024-11-22 00:59:11,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-22 00:59:11,028 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:11,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1419752293, now seen corresponding path program 1 times [2024-11-22 00:59:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819561744] [2024-11-22 00:59:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:11,028 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-22 00:59:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:11,029 INFO L229 MonitoredProcess]: Starting monitored process 18 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-22 00:59:11,030 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 (18)] Waiting until timeout for monitored process [2024-11-22 00:59:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:11,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 00:59:11,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-22 00:59:11,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:59:11,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:11,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819561744] [2024-11-22 00:59:11,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819561744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:59:11,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:59:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:59:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31325385] [2024-11-22 00:59:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:59:11,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:59:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:11,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:59:11,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:59:11,110 INFO L87 Difference]: Start difference. First operand 524 states and 686 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:11,132 INFO L93 Difference]: Finished difference Result 826 states and 1087 transitions. [2024-11-22 00:59:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:59:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-22 00:59:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:11,135 INFO L225 Difference]: With dead ends: 826 [2024-11-22 00:59:11,135 INFO L226 Difference]: Without dead ends: 548 [2024-11-22 00:59:11,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:59:11,136 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:11,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:59:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-22 00:59:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 534. [2024-11-22 00:59:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.3058161350844277) internal successors, (696), 533 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 696 transitions. [2024-11-22 00:59:11,152 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 696 transitions. Word has length 49 [2024-11-22 00:59:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:11,152 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 696 transitions. [2024-11-22 00:59:11,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 696 transitions. [2024-11-22 00:59:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 00:59:11,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:11,153 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 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-22 00:59:11,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-22 00:59:11,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-22 00:59:11,354 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:11,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1026725283, now seen corresponding path program 1 times [2024-11-22 00:59:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:11,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697609539] [2024-11-22 00:59:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:11,355 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-22 00:59:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:11,356 INFO L229 MonitoredProcess]: Starting monitored process 19 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-22 00:59:11,356 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 (19)] Waiting until timeout for monitored process [2024-11-22 00:59:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:11,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 00:59:11,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:11,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:11,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:11,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697609539] [2024-11-22 00:59:11,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697609539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:11,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:11,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 00:59:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624447948] [2024-11-22 00:59:11,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:11,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 00:59:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:11,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 00:59:11,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-22 00:59:11,684 INFO L87 Difference]: Start difference. First operand 534 states and 696 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:12,591 INFO L93 Difference]: Finished difference Result 1005 states and 1302 transitions. [2024-11-22 00:59:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 00:59:12,592 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-22 00:59:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:12,593 INFO L225 Difference]: With dead ends: 1005 [2024-11-22 00:59:12,593 INFO L226 Difference]: Without dead ends: 700 [2024-11-22 00:59:12,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2024-11-22 00:59:12,594 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 669 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:12,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 704 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 00:59:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-22 00:59:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 556. [2024-11-22 00:59:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.3045045045045045) internal successors, (724), 555 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 724 transitions. [2024-11-22 00:59:12,610 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 724 transitions. Word has length 49 [2024-11-22 00:59:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:12,610 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 724 transitions. [2024-11-22 00:59:12,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 724 transitions. [2024-11-22 00:59:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 00:59:12,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:12,611 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 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-22 00:59:12,615 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 (19)] Forceful destruction successful, exit code 0 [2024-11-22 00:59:12,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-22 00:59:12,812 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:12,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1028572325, now seen corresponding path program 1 times [2024-11-22 00:59:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:12,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439643100] [2024-11-22 00:59:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:12,813 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-22 00:59:12,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:12,815 INFO L229 MonitoredProcess]: Starting monitored process 20 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-22 00:59:12,817 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 (20)] Waiting until timeout for monitored process [2024-11-22 00:59:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:12,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 00:59:12,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:13,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:13,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:13,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439643100] [2024-11-22 00:59:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439643100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:13,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-11-22 00:59:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123216789] [2024-11-22 00:59:13,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:13,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 00:59:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 00:59:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-22 00:59:13,225 INFO L87 Difference]: Start difference. First operand 556 states and 724 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:15,027 INFO L93 Difference]: Finished difference Result 2184 states and 2856 transitions. [2024-11-22 00:59:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-22 00:59:15,028 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-22 00:59:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:15,032 INFO L225 Difference]: With dead ends: 2184 [2024-11-22 00:59:15,032 INFO L226 Difference]: Without dead ends: 2182 [2024-11-22 00:59:15,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2024-11-22 00:59:15,033 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 616 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:15,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 849 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 00:59:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2024-11-22 00:59:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 643. [2024-11-22 00:59:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.3255451713395638) internal successors, (851), 642 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 851 transitions. [2024-11-22 00:59:15,060 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 851 transitions. Word has length 49 [2024-11-22 00:59:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:15,061 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 851 transitions. [2024-11-22 00:59:15,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 851 transitions. [2024-11-22 00:59:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 00:59:15,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:15,061 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 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-22 00:59:15,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-22 00:59:15,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-22 00:59:15,265 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:15,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:15,265 INFO L85 PathProgramCache]: Analyzing trace with hash 15608033, now seen corresponding path program 1 times [2024-11-22 00:59:15,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:15,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880013559] [2024-11-22 00:59:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:15,266 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-22 00:59:15,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:15,268 INFO L229 MonitoredProcess]: Starting monitored process 21 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-22 00:59:15,269 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 (21)] Waiting until timeout for monitored process [2024-11-22 00:59:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:59:15,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 00:59:15,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:59:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:15,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:59:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 00:59:15,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:59:15,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880013559] [2024-11-22 00:59:15,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880013559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:59:15,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:59:15,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 00:59:15,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770271835] [2024-11-22 00:59:15,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:59:15,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 00:59:15,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:59:15,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 00:59:15,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-22 00:59:15,638 INFO L87 Difference]: Start difference. First operand 643 states and 851 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:59:18,584 INFO L93 Difference]: Finished difference Result 2536 states and 3312 transitions. [2024-11-22 00:59:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-22 00:59:18,585 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-22 00:59:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:59:18,590 INFO L225 Difference]: With dead ends: 2536 [2024-11-22 00:59:18,590 INFO L226 Difference]: Without dead ends: 2534 [2024-11-22 00:59:18,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 00:59:18,591 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 760 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:59:18,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1038 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 00:59:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2024-11-22 00:59:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 780. [2024-11-22 00:59:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 1.332477535301669) internal successors, (1038), 779 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1038 transitions. [2024-11-22 00:59:18,635 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1038 transitions. Word has length 49 [2024-11-22 00:59:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:59:18,635 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1038 transitions. [2024-11-22 00:59:18,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:59:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1038 transitions. [2024-11-22 00:59:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 00:59:18,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:59:18,636 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 2, 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-22 00:59:18,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-22 00:59:18,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-22 00:59:18,836 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:59:18,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:59:18,837 INFO L85 PathProgramCache]: Analyzing trace with hash 17455075, now seen corresponding path program 1 times [2024-11-22 00:59:18,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:59:18,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539278929] [2024-11-22 00:59:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:59:18,837 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-22 00:59:18,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:59:18,838 INFO L229 MonitoredProcess]: Starting monitored process 22 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-22 00:59:18,839 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 (22)] Waiting until timeout for monitored process [2024-11-22 00:59:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:59:18,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 00:59:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:59:19,014 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 00:59:19,014 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 00:59:19,015 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 00:59:19,021 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 (22)] Forceful destruction successful, exit code 0 [2024-11-22 00:59:19,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-22 00:59:19,219 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:59:19,250 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 00:59:19,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:59:19 BoogieIcfgContainer [2024-11-22 00:59:19,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 00:59:19,255 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 00:59:19,255 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 00:59:19,256 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 00:59:19,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:58:59" (3/4) ... [2024-11-22 00:59:19,258 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 00:59:19,259 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 00:59:19,259 INFO L158 Benchmark]: Toolchain (without parser) took 20182.27ms. Allocated memory was 58.7MB in the beginning and 94.4MB in the end (delta: 35.7MB). Free memory was 32.5MB in the beginning and 32.9MB in the end (delta: -370.7kB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-11-22 00:59:19,259 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 58.7MB. Free memory was 35.4MB in the beginning and 35.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:59:19,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.18ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 32.2MB in the beginning and 52.3MB in the end (delta: -20.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-22 00:59:19,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.82ms. Allocated memory is still 77.6MB. Free memory was 52.3MB in the beginning and 50.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:59:19,260 INFO L158 Benchmark]: Boogie Preprocessor took 61.08ms. Allocated memory is still 77.6MB. Free memory was 50.6MB in the beginning and 47.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 00:59:19,260 INFO L158 Benchmark]: RCFGBuilder took 427.06ms. Allocated memory is still 77.6MB. Free memory was 47.8MB in the beginning and 53.9MB in the end (delta: -6.2MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-22 00:59:19,261 INFO L158 Benchmark]: TraceAbstraction took 19362.42ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 53.5MB in the beginning and 32.9MB in the end (delta: 20.6MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2024-11-22 00:59:19,261 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 94.4MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:59:19,262 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.69ms. Allocated memory is still 58.7MB. Free memory was 35.4MB in the beginning and 35.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.18ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 32.2MB in the beginning and 52.3MB in the end (delta: -20.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.82ms. Allocated memory is still 77.6MB. Free memory was 52.3MB in the beginning and 50.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.08ms. Allocated memory is still 77.6MB. Free memory was 50.6MB in the beginning and 47.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 427.06ms. Allocated memory is still 77.6MB. Free memory was 47.8MB in the beginning and 53.9MB in the end (delta: -6.2MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19362.42ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 53.5MB in the beginning and 32.9MB in the end (delta: 20.6MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 94.4MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: 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 strncpy at line 42. Possible FailurePath: [L86] char A [2 + 2 + 4 +1]; [L87] int i = 0; VAL [A={3:0}, i=0] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=1] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=2] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=3] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=4] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=5] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=6] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=7] [L87] COND FALSE !(i<2 + 2 + 4 -1) VAL [A={3:0}] [L90] A[2 + 2 + 4] = 0 [L91] CALL parse_expression_list (A) [L60] int start=0, i=-1, j=-1; [L61] char str2[2]; VAL [i=-1, start=0, str2={7:0}, str={3:0}] [L62] COND FALSE !(!str) VAL [i=-1, start=0, str2={7:0}, str={3:0}] [L64] i++ [L65] str[i] [L66] case 0: VAL [i=0, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=1, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=2, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={3:0}] [L67] (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={3:0}] [L67] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L68] str[start] [L66] case 0: [L69] j = i-1 VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L71] EXPR str[j] [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L66] case 0: [L73] CALL r_strncpy(str2, str+start, j-start+1) [L42] return strncpy(dest,src,n); [L73] RET r_strncpy(str2, str+start, j-start+1) [L74] CALL __VERIFIER_assert(j - start + 1 < 2) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4493 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4493 mSDsluCounter, 7175 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6050 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5013 IncrementalHoareTripleChecker+Invalid, 5238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 1125 mSDtfsCounter, 5013 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1357 GetRequests, 1085 SyntacticMatches, 1 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=20, InterpolantAutomatonStates: 256, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 4346 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 838 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1227 ConstructedInterpolants, 0 QuantifiedInterpolants, 3785 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2165 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 1219/1365 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-22 00:59:19,284 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample