./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-mul-div-a046e57-m [2024-10-12 18:30:15,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:30:15,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:30:15,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:30:15,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:30:15,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:30:15,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:30:15,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:30:15,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:30:15,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:30:15,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:30:15,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:30:15,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:30:15,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:30:15,825 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:30:15,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:30:15,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:30:15,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:30:15,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:30:15,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:30:15,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:30:15,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:30:15,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:30:15,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:30:15,830 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:30:15,831 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:30:15,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:30:15,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:30:15,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:30:15,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:30:15,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:30:15,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:30:15,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:30:15,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:30:15,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:30:15,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:30:15,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:30:15,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:30:15,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:30:15,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:30:15,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:30:15,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:30:15,836 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-10-12 18:30:16,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:30:16,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:30:16,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:30:16,072 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:30:16,072 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:30:16,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-10-12 18:30:17,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:30:17,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:30:17,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-10-12 18:30:17,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b02ef5fac/108e38f734404d8b9befb4383e25a1dd/FLAGe89a3f1ed [2024-10-12 18:30:18,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b02ef5fac/108e38f734404d8b9befb4383e25a1dd [2024-10-12 18:30:18,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:30:18,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:30:18,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:30:18,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:30:18,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:30:18,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb2b14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18, skipping insertion in model container [2024-10-12 18:30:18,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:30:18,285 WARN L248 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-10-12 18:30:18,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:30:18,333 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:30:18,347 WARN L248 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-10-12 18:30:18,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:30:18,405 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:30:18,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18 WrapperNode [2024-10-12 18:30:18,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:30:18,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:30:18,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:30:18,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:30:18,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,468 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-10-12 18:30:18,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:30:18,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:30:18,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:30:18,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:30:18,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,514 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 1, 10]. 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, 1, 2]. [2024-10-12 18:30:18,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:30:18,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:30:18,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:30:18,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:30:18,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (1/1) ... [2024-10-12 18:30:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:30:18,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:18,595 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-10-12 18:30:18,598 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-10-12 18:30:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:30:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:30:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:30:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:30:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:30:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:30:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:30:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:30:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:30:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:30:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:30:18,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:30:18,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:30:18,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:30:18,703 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:30:18,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:30:18,925 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-10-12 18:30:18,925 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:30:18,958 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:30:18,958 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 18:30:18,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:30:18 BoogieIcfgContainer [2024-10-12 18:30:18,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:30:18,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:30:18,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:30:18,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:30:18,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:30:18" (1/3) ... [2024-10-12 18:30:18,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42169e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:30:18, skipping insertion in model container [2024-10-12 18:30:18,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:18" (2/3) ... [2024-10-12 18:30:18,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42169e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:30:18, skipping insertion in model container [2024-10-12 18:30:18,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:30:18" (3/3) ... [2024-10-12 18:30:18,968 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-10-12 18:30:18,985 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:30:18,986 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:30:19,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:30:19,050 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;@69bb0199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:30:19,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:30:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 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-10-12 18:30:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:30:19,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:19,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:19,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:19,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1212065736, now seen corresponding path program 1 times [2024-10-12 18:30:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:19,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678158066] [2024-10-12 18:30:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:19,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:19,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678158066] [2024-10-12 18:30:19,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678158066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:19,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:19,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:30:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706266206] [2024-10-12 18:30:19,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:19,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:30:19,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:19,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:30:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:30:19,351 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 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 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-10-12 18:30:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:19,387 INFO L93 Difference]: Finished difference Result 59 states and 93 transitions. [2024-10-12 18:30:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:30:19,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2024-10-12 18:30:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:19,397 INFO L225 Difference]: With dead ends: 59 [2024-10-12 18:30:19,397 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:30:19,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 18:30:19,404 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:19,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:30:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 18:30:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-10-12 18:30:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-12 18:30:19,473 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2024-10-12 18:30:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:19,474 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-12 18:30:19,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-10-12 18:30:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-12 18:30:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 18:30:19,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:19,475 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] [2024-10-12 18:30:19,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:30:19,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:19,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1222889611, now seen corresponding path program 1 times [2024-10-12 18:30:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708281668] [2024-10-12 18:30:19,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:19,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:19,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708281668] [2024-10-12 18:30:19,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708281668] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:30:19,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347754538] [2024-10-12 18:30:19,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:19,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:19,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:19,678 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-10-12 18:30:19,679 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-10-12 18:30:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:19,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 18:30:19,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:30:19,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:19,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347754538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:19,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:30:19,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 18:30:19,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778429710] [2024-10-12 18:30:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:19,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:30:19,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:19,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:30:19,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:30:19,793 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 18:30:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:19,827 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-10-12 18:30:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:30:19,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-10-12 18:30:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:19,830 INFO L225 Difference]: With dead ends: 52 [2024-10-12 18:30:19,831 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 18:30:19,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-10-12 18:30:19,833 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:19,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 18:30:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 18:30:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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-10-12 18:30:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-10-12 18:30:19,841 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 22 [2024-10-12 18:30:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:19,842 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-10-12 18:30:19,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 18:30:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-10-12 18:30:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 18:30:19,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:19,843 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] [2024-10-12 18:30:19,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:30:20,044 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-10-12 18:30:20,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:20,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:20,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2060960435, now seen corresponding path program 1 times [2024-10-12 18:30:20,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:20,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213335293] [2024-10-12 18:30:20,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:20,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213335293] [2024-10-12 18:30:20,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213335293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:30:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350761338] [2024-10-12 18:30:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:20,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:20,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:20,161 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-10-12 18:30:20,177 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-10-12 18:30:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:20,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:30:20,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:30:20,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350761338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:20,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:30:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2024-10-12 18:30:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205604779] [2024-10-12 18:30:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:20,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:30:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:20,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:30:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:30:20,365 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-10-12 18:30:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:20,462 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2024-10-12 18:30:20,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:30:20,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2024-10-12 18:30:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:20,464 INFO L225 Difference]: With dead ends: 63 [2024-10-12 18:30:20,464 INFO L226 Difference]: Without dead ends: 39 [2024-10-12 18:30:20,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 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-10-12 18:30:20,466 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:20,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-12 18:30:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2024-10-12 18:30:20,470 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-10-12 18:30:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-10-12 18:30:20,471 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 22 [2024-10-12 18:30:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:20,472 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-12 18:30:20,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-10-12 18:30:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-10-12 18:30:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 18:30:20,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:20,473 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] [2024-10-12 18:30:20,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 18:30:20,675 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-10-12 18:30:20,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:20,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2062867059, now seen corresponding path program 1 times [2024-10-12 18:30:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:20,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969158952] [2024-10-12 18:30:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:20,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969158952] [2024-10-12 18:30:20,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969158952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:30:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430419855] [2024-10-12 18:30:20,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:20,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:20,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:20,758 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-10-12 18:30:20,762 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-10-12 18:30:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:20,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 18:30:20,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:20,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:20,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430419855] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:20,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:30:20,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-12 18:30:20,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451966890] [2024-10-12 18:30:20,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:20,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:30:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:30:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:30:20,867 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) 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-10-12 18:30:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:20,889 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2024-10-12 18:30:20,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:30:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) 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 22 [2024-10-12 18:30:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:20,890 INFO L225 Difference]: With dead ends: 66 [2024-10-12 18:30:20,890 INFO L226 Difference]: Without dead ends: 36 [2024-10-12 18:30:20,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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-10-12 18:30:20,892 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:20,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-12 18:30:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-12 18:30:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-10-12 18:30:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-10-12 18:30:20,897 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 22 [2024-10-12 18:30:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:20,897 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-10-12 18:30:20,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) 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-10-12 18:30:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-10-12 18:30:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:30:20,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:20,898 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:20,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 18:30:21,099 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-10-12 18:30:21,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1200544991, now seen corresponding path program 2 times [2024-10-12 18:30:21,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640209131] [2024-10-12 18:30:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:21,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:21,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640209131] [2024-10-12 18:30:21,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640209131] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:30:21,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550220221] [2024-10-12 18:30:21,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:30:21,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:21,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:21,211 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-10-12 18:30:21,215 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-10-12 18:30:21,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 18:30:21,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:30:21,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:30:21,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:30:21,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550220221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:21,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:30:21,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-10-12 18:30:21,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034880827] [2024-10-12 18:30:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:21,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:30:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:30:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:30:21,395 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:21,499 INFO L93 Difference]: Finished difference Result 113 states and 149 transitions. [2024-10-12 18:30:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:30:21,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:21,500 INFO L225 Difference]: With dead ends: 113 [2024-10-12 18:30:21,500 INFO L226 Difference]: Without dead ends: 64 [2024-10-12 18:30:21,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:30:21,501 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:21,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 106 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-12 18:30:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. [2024-10-12 18:30:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 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-10-12 18:30:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2024-10-12 18:30:21,507 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 25 [2024-10-12 18:30:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:21,507 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-10-12 18:30:21,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2024-10-12 18:30:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:30:21,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:21,508 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:21,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 18:30:21,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:21,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1901609569, now seen corresponding path program 1 times [2024-10-12 18:30:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:21,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864210462] [2024-10-12 18:30:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:30:21,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:21,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864210462] [2024-10-12 18:30:21,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864210462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:21,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:21,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:30:21,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358581639] [2024-10-12 18:30:21,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:21,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:30:21,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:21,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:30:21,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:30:21,843 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:21,908 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2024-10-12 18:30:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:30:21,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:21,911 INFO L225 Difference]: With dead ends: 77 [2024-10-12 18:30:21,911 INFO L226 Difference]: Without dead ends: 75 [2024-10-12 18:30:21,912 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-10-12 18:30:21,912 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:21,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 102 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-12 18:30:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2024-10-12 18:30:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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-10-12 18:30:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-10-12 18:30:21,920 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 25 [2024-10-12 18:30:21,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:21,920 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-10-12 18:30:21,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-10-12 18:30:21,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:30:21,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:21,921 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 18:30:21,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:30:21,922 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:21,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash -520705210, now seen corresponding path program 1 times [2024-10-12 18:30:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:21,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578427845] [2024-10-12 18:30:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:30:21,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578427845] [2024-10-12 18:30:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578427845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:21,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:21,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:30:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670750922] [2024-10-12 18:30:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:30:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:21,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:30:21,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:30:21,975 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-12 18:30:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:22,001 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2024-10-12 18:30:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:30:22,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 27 [2024-10-12 18:30:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:22,002 INFO L225 Difference]: With dead ends: 96 [2024-10-12 18:30:22,002 INFO L226 Difference]: Without dead ends: 68 [2024-10-12 18:30:22,003 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-10-12 18:30:22,003 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:22,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-12 18:30:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-12 18:30:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 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-10-12 18:30:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-10-12 18:30:22,013 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 27 [2024-10-12 18:30:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:22,013 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-10-12 18:30:22,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-12 18:30:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-10-12 18:30:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:30:22,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:22,014 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 18:30:22,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 18:30:22,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:22,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 159353160, now seen corresponding path program 1 times [2024-10-12 18:30:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:22,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177329605] [2024-10-12 18:30:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:22,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:22,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177329605] [2024-10-12 18:30:22,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177329605] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:30:22,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615454493] [2024-10-12 18:30:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:22,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:22,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:22,103 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-10-12 18:30:22,106 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-10-12 18:30:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:22,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 18:30:22,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:22,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:22,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615454493] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:22,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:30:22,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-12 18:30:22,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774960572] [2024-10-12 18:30:22,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:22,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 18:30:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:22,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 18:30:22,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:30:22,248 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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-10-12 18:30:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:22,269 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2024-10-12 18:30:22,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 18:30:22,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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 27 [2024-10-12 18:30:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:22,271 INFO L225 Difference]: With dead ends: 133 [2024-10-12 18:30:22,271 INFO L226 Difference]: Without dead ends: 71 [2024-10-12 18:30:22,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 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-10-12 18:30:22,272 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:22,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-12 18:30:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-12 18:30:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 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-10-12 18:30:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2024-10-12 18:30:22,277 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 27 [2024-10-12 18:30:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:22,278 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2024-10-12 18:30:22,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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-10-12 18:30:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2024-10-12 18:30:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 18:30:22,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:22,279 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 18:30:22,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 18:30:22,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:22,480 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:22,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash 790768220, now seen corresponding path program 2 times [2024-10-12 18:30:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:22,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130251931] [2024-10-12 18:30:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:22,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:22,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:22,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130251931] [2024-10-12 18:30:22,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130251931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:22,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:22,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:30:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225287435] [2024-10-12 18:30:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:22,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:30:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:30:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:30:22,578 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-10-12 18:30:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:22,645 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2024-10-12 18:30:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:30:22,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2024-10-12 18:30:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:22,646 INFO L225 Difference]: With dead ends: 130 [2024-10-12 18:30:22,646 INFO L226 Difference]: Without dead ends: 87 [2024-10-12 18:30:22,646 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-10-12 18:30:22,647 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:22,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 121 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-12 18:30:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2024-10-12 18:30:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 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-10-12 18:30:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2024-10-12 18:30:22,684 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 30 [2024-10-12 18:30:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:22,685 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2024-10-12 18:30:22,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-10-12 18:30:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2024-10-12 18:30:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:30:22,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:22,686 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:22,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 18:30:22,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:22,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -670035066, now seen corresponding path program 1 times [2024-10-12 18:30:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:22,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546492326] [2024-10-12 18:30:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 18:30:22,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:22,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546492326] [2024-10-12 18:30:22,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546492326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:22,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:22,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:30:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435326019] [2024-10-12 18:30:22,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:22,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:30:22,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:30:22,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:30:22,907 INFO L87 Difference]: Start difference. First operand 74 states and 92 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-10-12 18:30:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:23,081 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2024-10-12 18:30:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:30:23,082 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 32 [2024-10-12 18:30:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:23,083 INFO L225 Difference]: With dead ends: 142 [2024-10-12 18:30:23,083 INFO L226 Difference]: Without dead ends: 107 [2024-10-12 18:30:23,083 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-10-12 18:30:23,084 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:23,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 185 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-12 18:30:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2024-10-12 18:30:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 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-10-12 18:30:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2024-10-12 18:30:23,089 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 32 [2024-10-12 18:30:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:23,089 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2024-10-12 18:30:23,089 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-10-12 18:30:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2024-10-12 18:30:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 18:30:23,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:23,090 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:23,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 18:30:23,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:23,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1584945875, now seen corresponding path program 1 times [2024-10-12 18:30:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114830455] [2024-10-12 18:30:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:23,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:23,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:23,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114830455] [2024-10-12 18:30:23,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114830455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:30:23,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858218467] [2024-10-12 18:30:23,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:23,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:23,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:23,192 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-10-12 18:30:23,193 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-10-12 18:30:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:23,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 18:30:23,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:23,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:23,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858218467] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:23,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:30:23,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-10-12 18:30:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804967754] [2024-10-12 18:30:23,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:23,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:30:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:23,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:30:23,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:30:23,348 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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-10-12 18:30:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:23,422 INFO L93 Difference]: Finished difference Result 200 states and 250 transitions. [2024-10-12 18:30:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 18:30:23,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 34 [2024-10-12 18:30:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:23,423 INFO L225 Difference]: With dead ends: 200 [2024-10-12 18:30:23,423 INFO L226 Difference]: Without dead ends: 141 [2024-10-12 18:30:23,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:30:23,424 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 65 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:23,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 133 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-12 18:30:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 120. [2024-10-12 18:30:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 119 states have internal predecessors, (148), 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-10-12 18:30:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 148 transitions. [2024-10-12 18:30:23,433 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 148 transitions. Word has length 34 [2024-10-12 18:30:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:23,437 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 148 transitions. [2024-10-12 18:30:23,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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-10-12 18:30:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 148 transitions. [2024-10-12 18:30:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:30:23,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:23,438 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:23,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 18:30:23,639 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-10-12 18:30:23,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1116402816, now seen corresponding path program 2 times [2024-10-12 18:30:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950494633] [2024-10-12 18:30:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:23,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950494633] [2024-10-12 18:30:23,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950494633] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:30:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562202239] [2024-10-12 18:30:23,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:30:23,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:23,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:23,804 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-10-12 18:30:23,805 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-10-12 18:30:23,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:30:23,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:30:23,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 18:30:23,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:24,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:24,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562202239] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:24,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:30:24,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2024-10-12 18:30:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828139382] [2024-10-12 18:30:24,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:24,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 18:30:24,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 18:30:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:30:24,189 INFO L87 Difference]: Start difference. First operand 120 states and 148 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 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-10-12 18:30:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:24,756 INFO L93 Difference]: Finished difference Result 412 states and 533 transitions. [2024-10-12 18:30:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-12 18:30:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 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 38 [2024-10-12 18:30:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:24,757 INFO L225 Difference]: With dead ends: 412 [2024-10-12 18:30:24,757 INFO L226 Difference]: Without dead ends: 215 [2024-10-12 18:30:24,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 18:30:24,758 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 407 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:24,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 635 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:30:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-12 18:30:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 141. [2024-10-12 18:30:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.25) internal successors, (175), 140 states have internal predecessors, (175), 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-10-12 18:30:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 175 transitions. [2024-10-12 18:30:24,763 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 175 transitions. Word has length 38 [2024-10-12 18:30:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:24,763 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 175 transitions. [2024-10-12 18:30:24,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 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-10-12 18:30:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions. [2024-10-12 18:30:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:30:24,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:24,767 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:24,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-12 18:30:24,967 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-10-12 18:30:24,968 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:24,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1703208830, now seen corresponding path program 1 times [2024-10-12 18:30:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:24,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864024235] [2024-10-12 18:30:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:30:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864024235] [2024-10-12 18:30:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864024235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:30:25,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612002737] [2024-10-12 18:30:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:25,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:30:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:25,124 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:30:25,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 18:30:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:25,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 18:30:25,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:25,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:25,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612002737] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:25,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:30:25,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-12 18:30:25,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121105571] [2024-10-12 18:30:25,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:25,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 18:30:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:30:25,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 18:30:25,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2024-10-12 18:30:25,500 INFO L87 Difference]: Start difference. First operand 141 states and 175 transitions. Second operand has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 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-10-12 18:30:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:26,003 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2024-10-12 18:30:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 18:30:26,004 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 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 38 [2024-10-12 18:30:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:26,005 INFO L225 Difference]: With dead ends: 252 [2024-10-12 18:30:26,005 INFO L226 Difference]: Without dead ends: 250 [2024-10-12 18:30:26,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=919, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 18:30:26,006 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 209 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:26,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 327 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 18:30:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-12 18:30:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 163. [2024-10-12 18:30:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.2839506172839505) internal successors, (208), 162 states have internal predecessors, (208), 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-10-12 18:30:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 208 transitions. [2024-10-12 18:30:26,012 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 208 transitions. Word has length 38 [2024-10-12 18:30:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:26,012 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 208 transitions. [2024-10-12 18:30:26,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 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-10-12 18:30:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 208 transitions. [2024-10-12 18:30:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:30:26,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:26,013 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:26,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 18:30:26,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 18:30:26,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:26,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1703149248, now seen corresponding path program 1 times [2024-10-12 18:30:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:30:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289311633] [2024-10-12 18:30:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:30:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:30:26,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:30:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:30:26,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 18:30:26,266 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:30:26,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:30:26,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 18:30:26,271 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:26,295 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:30:26,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:30:26 BoogieIcfgContainer [2024-10-12 18:30:26,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:30:26,297 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:30:26,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:30:26,298 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:30:26,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:30:18" (3/4) ... [2024-10-12 18:30:26,299 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 18:30:26,300 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:30:26,301 INFO L158 Benchmark]: Toolchain (without parser) took 8207.21ms. Allocated memory was 134.2MB in the beginning and 245.4MB in the end (delta: 111.1MB). Free memory was 65.7MB in the beginning and 114.4MB in the end (delta: -48.7MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2024-10-12 18:30:26,301 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:30:26,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.87ms. Allocated memory was 134.2MB in the beginning and 199.2MB in the end (delta: 65.0MB). Free memory was 65.5MB in the beginning and 162.5MB in the end (delta: -97.0MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-10-12 18:30:26,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.68ms. Allocated memory is still 199.2MB. Free memory was 162.5MB in the beginning and 160.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:30:26,302 INFO L158 Benchmark]: Boogie Preprocessor took 77.29ms. Allocated memory is still 199.2MB. Free memory was 160.3MB in the beginning and 158.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:30:26,302 INFO L158 Benchmark]: RCFGBuilder took 411.32ms. Allocated memory is still 199.2MB. Free memory was 158.3MB in the beginning and 139.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 18:30:26,302 INFO L158 Benchmark]: TraceAbstraction took 7336.16ms. Allocated memory was 199.2MB in the beginning and 245.4MB in the end (delta: 46.1MB). Free memory was 138.6MB in the beginning and 115.4MB in the end (delta: 23.1MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2024-10-12 18:30:26,302 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 245.4MB. Free memory was 115.4MB in the beginning and 114.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:30:26,303 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 134.2MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.87ms. Allocated memory was 134.2MB in the beginning and 199.2MB in the end (delta: 65.0MB). Free memory was 65.5MB in the beginning and 162.5MB in the end (delta: -97.0MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.68ms. Allocated memory is still 199.2MB. Free memory was 162.5MB in the beginning and 160.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.29ms. Allocated memory is still 199.2MB. Free memory was 160.3MB in the beginning and 158.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 411.32ms. Allocated memory is still 199.2MB. Free memory was 158.3MB in the beginning and 139.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7336.16ms. Allocated memory was 199.2MB in the beginning and 245.4MB in the end (delta: 46.1MB). Free memory was 138.6MB in the beginning and 115.4MB in the end (delta: 23.1MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 245.4MB. Free memory was 115.4MB in the beginning and 114.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 828 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 828 mSDsluCounter, 2090 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1677 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1804 IncrementalHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 413 mSDtfsCounter, 1804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 347 SyntacticMatches, 12 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=13, InterpolantAutomatonStates: 118, 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, 13 MinimizatonAttempts, 252 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 625 NumberOfCodeBlocks, 621 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 720 ConstructedInterpolants, 0 QuantifiedInterpolants, 1952 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1150 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 342/441 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-10-12 18:30:26,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-mul-div-a046e57-m [2024-10-12 18:30:29,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:30:29,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 18:30:29,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:30:29,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:30:29,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:30:29,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:30:29,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:30:29,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:30:29,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:30:29,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:30:29,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:30:29,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:30:29,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:30:29,408 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:30:29,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:30:29,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:30:29,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:30:29,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:30:29,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:30:29,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:30:29,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:30:29,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:30:29,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 18:30:29,414 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 18:30:29,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:30:29,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 18:30:29,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:30:29,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:30:29,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:30:29,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:30:29,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:30:29,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:30:29,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:30:29,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:30:29,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:30:29,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:30:29,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:30:29,419 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 18:30:29,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 18:30:29,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:30:29,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:30:29,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:30:29,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:30:29,421 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 18:30:29,421 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-10-12 18:30:29,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:30:29,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:30:29,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:30:29,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:30:29,706 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:30:29,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-10-12 18:30:31,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:30:31,789 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:30:31,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-10-12 18:30:31,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca25676df/996bbd2445544079b05fb977ceab8da8/FLAG2a752194e [2024-10-12 18:30:31,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca25676df/996bbd2445544079b05fb977ceab8da8 [2024-10-12 18:30:31,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:30:31,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:30:31,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:30:31,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:30:31,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:30:31,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:30:31" (1/1) ... [2024-10-12 18:30:31,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c080e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:31, skipping insertion in model container [2024-10-12 18:30:31,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:30:31" (1/1) ... [2024-10-12 18:30:31,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:30:32,075 WARN L248 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-10-12 18:30:32,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:30:32,151 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:30:32,164 WARN L248 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-10-12 18:30:32,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:30:32,215 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:30:32,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32 WrapperNode [2024-10-12 18:30:32,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:30:32,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:30:32,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:30:32,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:30:32,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,264 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-10-12 18:30:32,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:30:32,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:30:32,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:30:32,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:30:32,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,311 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-10-12 18:30:32,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:30:32,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:30:32,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:30:32,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:30:32,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (1/1) ... [2024-10-12 18:30:32,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:30:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:30:32,385 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-10-12 18:30:32,395 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-10-12 18:30:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:30:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-12 18:30:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-12 18:30:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-12 18:30:32,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 18:30:32,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 18:30:32,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-12 18:30:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:30:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:30:32,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:30:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-12 18:30:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-12 18:30:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-12 18:30:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:30:32,574 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:30:32,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:30:32,852 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-12 18:30:32,853 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:30:32,909 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:30:32,909 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 18:30:32,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:30:32 BoogieIcfgContainer [2024-10-12 18:30:32,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:30:32,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:30:32,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:30:32,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:30:32,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:30:31" (1/3) ... [2024-10-12 18:30:32,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2097519a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:30:32, skipping insertion in model container [2024-10-12 18:30:32,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:30:32" (2/3) ... [2024-10-12 18:30:32,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2097519a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:30:32, skipping insertion in model container [2024-10-12 18:30:32,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:30:32" (3/3) ... [2024-10-12 18:30:32,921 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-10-12 18:30:32,939 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:30:32,939 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:30:33,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:30:33,017 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;@60cc2c90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:30:33,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:30:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 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-10-12 18:30:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:30:33,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:33,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:33,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:33,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:33,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1212065736, now seen corresponding path program 1 times [2024-10-12 18:30:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:33,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590863031] [2024-10-12 18:30:33,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:33,053 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-10-12 18:30:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:33,057 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-10-12 18:30:33,066 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-10-12 18:30:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:33,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 18:30:33,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:33,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:33,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:33,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590863031] [2024-10-12 18:30:33,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590863031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:33,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:33,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:30:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028095527] [2024-10-12 18:30:33,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:33,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:30:33,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:33,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:30:33,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:30:33,236 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-10-12 18:30:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:33,268 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2024-10-12 18:30:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:30:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2024-10-12 18:30:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:33,279 INFO L225 Difference]: With dead ends: 58 [2024-10-12 18:30:33,279 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 18:30:33,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-10-12 18:30:33,285 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 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-10-12 18:30:33,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 18:30:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-12 18:30:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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-10-12 18:30:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2024-10-12 18:30:33,317 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2024-10-12 18:30:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:33,318 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2024-10-12 18:30:33,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-10-12 18:30:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-10-12 18:30:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 18:30:33,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:33,319 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] [2024-10-12 18:30:33,324 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-10-12 18:30:33,520 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-10-12 18:30:33,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:33,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2071997665, now seen corresponding path program 1 times [2024-10-12 18:30:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:33,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138574802] [2024-10-12 18:30:33,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:33,527 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-10-12 18:30:33,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:33,529 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-10-12 18:30:33,531 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-10-12 18:30:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:33,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 18:30:33,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:33,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:33,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:33,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138574802] [2024-10-12 18:30:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138574802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:33,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:33,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:30:33,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031460385] [2024-10-12 18:30:33,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:33,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:30:33,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:33,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:30:33,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:30:33,691 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-10-12 18:30:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:33,728 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2024-10-12 18:30:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:30:33,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 21 [2024-10-12 18:30:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:33,729 INFO L225 Difference]: With dead ends: 53 [2024-10-12 18:30:33,729 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:30:33,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-10-12 18:30:33,731 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:33,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:30:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 18:30:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-10-12 18:30:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-12 18:30:33,741 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 21 [2024-10-12 18:30:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:33,741 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-12 18:30:33,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-10-12 18:30:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-12 18:30:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 18:30:33,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:33,742 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] [2024-10-12 18:30:33,750 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-10-12 18:30:33,944 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-10-12 18:30:33,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:33,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1222889611, now seen corresponding path program 1 times [2024-10-12 18:30:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481993904] [2024-10-12 18:30:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:33,946 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-10-12 18:30:33,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:33,947 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-10-12 18:30:33,949 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-10-12 18:30:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:34,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 18:30:34,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:34,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:34,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481993904] [2024-10-12 18:30:34,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481993904] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:34,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:34,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-12 18:30:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796077069] [2024-10-12 18:30:34,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:34,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:30:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:30:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:30:34,060 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) 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-10-12 18:30:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:34,130 INFO L93 Difference]: Finished difference Result 56 states and 78 transitions. [2024-10-12 18:30:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:30:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) 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 22 [2024-10-12 18:30:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:34,132 INFO L225 Difference]: With dead ends: 56 [2024-10-12 18:30:34,132 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:30:34,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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-10-12 18:30:34,133 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:34,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:30:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 18:30:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 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-10-12 18:30:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-10-12 18:30:34,141 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 22 [2024-10-12 18:30:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:34,141 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-10-12 18:30:34,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) 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-10-12 18:30:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-10-12 18:30:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:30:34,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:34,145 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:34,152 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-10-12 18:30:34,346 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-10-12 18:30:34,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:34,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2085211679, now seen corresponding path program 2 times [2024-10-12 18:30:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:34,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57414576] [2024-10-12 18:30:34,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:30:34,348 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-10-12 18:30:34,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:34,351 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-10-12 18:30:34,352 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-10-12 18:30:34,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 18:30:34,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:30:34,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 18:30:34,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:30:34,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:34,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57414576] [2024-10-12 18:30:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57414576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:34,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:34,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:30:34,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142513384] [2024-10-12 18:30:34,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:34,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:30:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:34,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:30:34,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:30:34,440 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 18:30:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:34,471 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2024-10-12 18:30:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:30:34,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 18:30:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:34,473 INFO L225 Difference]: With dead ends: 55 [2024-10-12 18:30:34,473 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 18:30:34,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-10-12 18:30:34,474 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:34,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 18:30:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-12 18:30:34,478 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-10-12 18:30:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-12 18:30:34,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 25 [2024-10-12 18:30:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:34,479 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-12 18:30:34,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 18:30:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-10-12 18:30:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:30:34,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:34,481 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:34,487 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-10-12 18:30:34,681 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-10-12 18:30:34,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1198638367, now seen corresponding path program 1 times [2024-10-12 18:30:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118222010] [2024-10-12 18:30:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:34,684 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-10-12 18:30:34,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:34,686 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-10-12 18:30:34,692 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-10-12 18:30:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:34,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 18:30:34,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:34,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:30:34,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:34,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118222010] [2024-10-12 18:30:34,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118222010] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:34,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:34,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-12 18:30:34,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625948627] [2024-10-12 18:30:34,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:34,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:30:34,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:34,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:30:34,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:30:34,900 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 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-10-12 18:30:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:34,994 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2024-10-12 18:30:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 18:30:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 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 25 [2024-10-12 18:30:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:34,995 INFO L225 Difference]: With dead ends: 61 [2024-10-12 18:30:34,996 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 18:30:34,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 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-10-12 18:30:34,997 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:34,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 18:30:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-12 18:30:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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-10-12 18:30:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-10-12 18:30:35,002 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 25 [2024-10-12 18:30:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:35,002 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-10-12 18:30:35,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 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-10-12 18:30:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-10-12 18:30:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:30:35,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:35,003 INFO L215 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:35,011 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-10-12 18:30:35,206 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-10-12 18:30:35,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:35,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:35,207 INFO L85 PathProgramCache]: Analyzing trace with hash -38692045, now seen corresponding path program 2 times [2024-10-12 18:30:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:35,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145309861] [2024-10-12 18:30:35,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:30:35,208 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-10-12 18:30:35,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:35,214 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-10-12 18:30:35,217 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-10-12 18:30:35,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 18:30:35,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:30:35,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 18:30:35,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:35,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:35,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:35,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145309861] [2024-10-12 18:30:35,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145309861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:35,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:35,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:30:35,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261446146] [2024-10-12 18:30:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:35,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:30:35,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:35,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:30:35,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:30:35,422 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:35,565 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2024-10-12 18:30:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:30:35,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 28 [2024-10-12 18:30:35,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:35,567 INFO L225 Difference]: With dead ends: 99 [2024-10-12 18:30:35,567 INFO L226 Difference]: Without dead ends: 75 [2024-10-12 18:30:35,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 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-10-12 18:30:35,568 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 53 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:35,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 116 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-12 18:30:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2024-10-12 18:30:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 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-10-12 18:30:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2024-10-12 18:30:35,576 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 28 [2024-10-12 18:30:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:35,576 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2024-10-12 18:30:35,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:35,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2024-10-12 18:30:35,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:30:35,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:35,577 INFO L215 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:35,583 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-10-12 18:30:35,778 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-10-12 18:30:35,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:35,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:35,779 INFO L85 PathProgramCache]: Analyzing trace with hash -36785421, now seen corresponding path program 1 times [2024-10-12 18:30:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:35,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897336760] [2024-10-12 18:30:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:35,780 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-10-12 18:30:35,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:35,782 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-10-12 18:30:35,783 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-10-12 18:30:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:35,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:30:35,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:36,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:36,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:36,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897336760] [2024-10-12 18:30:36,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897336760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:36,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:36,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:30:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948649289] [2024-10-12 18:30:36,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:36,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:30:36,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:36,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:30:36,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:30:36,027 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:36,191 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2024-10-12 18:30:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:30:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 28 [2024-10-12 18:30:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:36,194 INFO L225 Difference]: With dead ends: 141 [2024-10-12 18:30:36,194 INFO L226 Difference]: Without dead ends: 112 [2024-10-12 18:30:36,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:30:36,195 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:36,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 155 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-12 18:30:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 69. [2024-10-12 18:30:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 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-10-12 18:30:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2024-10-12 18:30:36,204 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 28 [2024-10-12 18:30:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:36,204 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2024-10-12 18:30:36,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-10-12 18:30:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2024-10-12 18:30:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:30:36,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:36,205 INFO L215 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:36,211 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 (8)] Ended with exit code 0 [2024-10-12 18:30:36,405 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-10-12 18:30:36,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:36,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 664279157, now seen corresponding path program 1 times [2024-10-12 18:30:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:36,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41912725] [2024-10-12 18:30:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:36,407 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-10-12 18:30:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:36,409 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-10-12 18:30:36,412 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-10-12 18:30:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:36,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 18:30:36,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:36,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:36,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41912725] [2024-10-12 18:30:36,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41912725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:36,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:36,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:30:36,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965052305] [2024-10-12 18:30:36,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:36,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:30:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:36,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:30:36,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:30:36,587 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-10-12 18:30:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:36,680 INFO L93 Difference]: Finished difference Result 121 states and 163 transitions. [2024-10-12 18:30:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:30:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 28 [2024-10-12 18:30:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:36,681 INFO L225 Difference]: With dead ends: 121 [2024-10-12 18:30:36,681 INFO L226 Difference]: Without dead ends: 92 [2024-10-12 18:30:36,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-10-12 18:30:36,682 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:36,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 113 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-12 18:30:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2024-10-12 18:30:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 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-10-12 18:30:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2024-10-12 18:30:36,694 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 28 [2024-10-12 18:30:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:36,694 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2024-10-12 18:30:36,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-10-12 18:30:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2024-10-12 18:30:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:30:36,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:36,698 INFO L215 NwaCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:36,702 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-10-12 18:30:36,898 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-10-12 18:30:36,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:36,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash -827715476, now seen corresponding path program 1 times [2024-10-12 18:30:36,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:36,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414568885] [2024-10-12 18:30:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:36,901 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-10-12 18:30:36,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:36,903 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-10-12 18:30:36,904 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-10-12 18:30:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:36,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 18:30:36,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:37,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:37,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:37,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414568885] [2024-10-12 18:30:37,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414568885] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:37,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:37,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-12 18:30:37,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027463269] [2024-10-12 18:30:37,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:37,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:30:37,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:37,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:30:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:30:37,209 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-10-12 18:30:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:38,262 INFO L93 Difference]: Finished difference Result 395 states and 542 transitions. [2024-10-12 18:30:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 18:30:38,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-10-12 18:30:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:38,264 INFO L225 Difference]: With dead ends: 395 [2024-10-12 18:30:38,265 INFO L226 Difference]: Without dead ends: 352 [2024-10-12 18:30:38,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 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-10-12 18:30:38,266 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 499 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:38,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 408 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 18:30:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-12 18:30:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 206. [2024-10-12 18:30:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.4146341463414633) internal successors, (290), 205 states have internal predecessors, (290), 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-10-12 18:30:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 290 transitions. [2024-10-12 18:30:38,284 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 290 transitions. Word has length 31 [2024-10-12 18:30:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:38,284 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 290 transitions. [2024-10-12 18:30:38,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-10-12 18:30:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 290 transitions. [2024-10-12 18:30:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:30:38,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:38,286 INFO L215 NwaCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:38,296 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 (10)] Ended with exit code 0 [2024-10-12 18:30:38,486 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-10-12 18:30:38,486 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:38,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash 187848817, now seen corresponding path program 1 times [2024-10-12 18:30:38,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:38,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519424964] [2024-10-12 18:30:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:38,488 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-10-12 18:30:38,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:38,489 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-10-12 18:30:38,491 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-10-12 18:30:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:38,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 18:30:38,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:38,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:38,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:38,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519424964] [2024-10-12 18:30:38,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519424964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:38,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:38,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:30:38,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625767504] [2024-10-12 18:30:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:38,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:30:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:38,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:30:38,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:30:38,665 INFO L87 Difference]: Start difference. First operand 206 states and 290 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-10-12 18:30:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:38,797 INFO L93 Difference]: Finished difference Result 290 states and 404 transitions. [2024-10-12 18:30:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:30:38,798 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-10-12 18:30:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:38,799 INFO L225 Difference]: With dead ends: 290 [2024-10-12 18:30:38,799 INFO L226 Difference]: Without dead ends: 127 [2024-10-12 18:30:38,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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-10-12 18:30:38,800 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:38,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 140 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-12 18:30:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2024-10-12 18:30:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 112 states have internal predecessors, (152), 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-10-12 18:30:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2024-10-12 18:30:38,822 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 31 [2024-10-12 18:30:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:38,822 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2024-10-12 18:30:38,822 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-10-12 18:30:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2024-10-12 18:30:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:30:38,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:38,829 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:38,839 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 (11)] Forceful destruction successful, exit code 0 [2024-10-12 18:30:39,030 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-10-12 18:30:39,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:39,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash -671941690, now seen corresponding path program 1 times [2024-10-12 18:30:39,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:39,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085284681] [2024-10-12 18:30:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:39,031 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-10-12 18:30:39,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:39,034 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-10-12 18:30:39,046 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-10-12 18:30:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:39,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 18:30:39,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:39,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:39,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085284681] [2024-10-12 18:30:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085284681] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:39,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-10-12 18:30:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208020018] [2024-10-12 18:30:39,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:30:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:39,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:30:39,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:30:39,387 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-10-12 18:30:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:39,767 INFO L93 Difference]: Finished difference Result 220 states and 292 transitions. [2024-10-12 18:30:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 18:30:39,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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) Word has length 32 [2024-10-12 18:30:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:39,769 INFO L225 Difference]: With dead ends: 220 [2024-10-12 18:30:39,769 INFO L226 Difference]: Without dead ends: 190 [2024-10-12 18:30:39,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-10-12 18:30:39,770 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 144 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:39,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 295 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 18:30:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-12 18:30:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 155. [2024-10-12 18:30:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 154 states have internal predecessors, (210), 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-10-12 18:30:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 210 transitions. [2024-10-12 18:30:39,779 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 210 transitions. Word has length 32 [2024-10-12 18:30:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:39,779 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 210 transitions. [2024-10-12 18:30:39,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-10-12 18:30:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 210 transitions. [2024-10-12 18:30:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:30:39,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:39,780 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:39,785 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 (12)] Ended with exit code 0 [2024-10-12 18:30:39,984 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-10-12 18:30:39,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:39,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash 31029512, now seen corresponding path program 1 times [2024-10-12 18:30:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:39,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129545562] [2024-10-12 18:30:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:39,985 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-10-12 18:30:39,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:39,988 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-10-12 18:30:39,989 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-10-12 18:30:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:40,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:30:40,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:40,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:40,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:40,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129545562] [2024-10-12 18:30:40,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129545562] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:40,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:40,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-12 18:30:40,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752167518] [2024-10-12 18:30:40,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:40,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:30:40,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:40,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:30:40,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:30:40,443 INFO L87 Difference]: Start difference. First operand 155 states and 210 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-10-12 18:30:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:41,563 INFO L93 Difference]: Finished difference Result 413 states and 562 transitions. [2024-10-12 18:30:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 18:30:41,564 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 32 [2024-10-12 18:30:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:41,565 INFO L225 Difference]: With dead ends: 413 [2024-10-12 18:30:41,565 INFO L226 Difference]: Without dead ends: 411 [2024-10-12 18:30:41,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-10-12 18:30:41,568 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 329 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:41,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 407 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 18:30:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-12 18:30:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 206. [2024-10-12 18:30:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3804878048780487) internal successors, (283), 205 states have internal predecessors, (283), 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-10-12 18:30:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 283 transitions. [2024-10-12 18:30:41,577 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 283 transitions. Word has length 32 [2024-10-12 18:30:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:41,577 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 283 transitions. [2024-10-12 18:30:41,578 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-10-12 18:30:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 283 transitions. [2024-10-12 18:30:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 18:30:41,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:41,579 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:41,589 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-10-12 18:30:41,779 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-10-12 18:30:41,780 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:41,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash -90449191, now seen corresponding path program 2 times [2024-10-12 18:30:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:41,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407501213] [2024-10-12 18:30:41,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:30:41,781 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-10-12 18:30:41,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:41,783 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-10-12 18:30:41,784 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-10-12 18:30:41,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 18:30:41,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:30:41,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:30:41,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 18:30:41,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:41,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:41,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407501213] [2024-10-12 18:30:41,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407501213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:41,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:41,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:30:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178950581] [2024-10-12 18:30:41,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:41,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:30:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:41,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:30:41,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:30:41,908 INFO L87 Difference]: Start difference. First operand 206 states and 283 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-10-12 18:30:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:42,037 INFO L93 Difference]: Finished difference Result 278 states and 376 transitions. [2024-10-12 18:30:42,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:30:42,038 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 36 [2024-10-12 18:30:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:42,039 INFO L225 Difference]: With dead ends: 278 [2024-10-12 18:30:42,039 INFO L226 Difference]: Without dead ends: 222 [2024-10-12 18:30:42,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:30:42,041 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:42,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 89 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-12 18:30:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 203. [2024-10-12 18:30:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.381188118811881) internal successors, (279), 202 states have internal predecessors, (279), 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-10-12 18:30:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 279 transitions. [2024-10-12 18:30:42,050 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 279 transitions. Word has length 36 [2024-10-12 18:30:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:42,050 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 279 transitions. [2024-10-12 18:30:42,050 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-10-12 18:30:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 279 transitions. [2024-10-12 18:30:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 18:30:42,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:42,053 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:42,060 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-10-12 18:30:42,253 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-10-12 18:30:42,254 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:42,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash -88542567, now seen corresponding path program 1 times [2024-10-12 18:30:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988415383] [2024-10-12 18:30:42,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:42,255 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-10-12 18:30:42,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:42,258 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-10-12 18:30:42,259 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-10-12 18:30:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:42,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:30:42,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:42,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:42,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988415383] [2024-10-12 18:30:42,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988415383] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:42,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:42,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-12 18:30:42,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266277345] [2024-10-12 18:30:42,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:42,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 18:30:42,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:42,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 18:30:42,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:30:42,457 INFO L87 Difference]: Start difference. First operand 203 states and 279 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 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-10-12 18:30:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:42,937 INFO L93 Difference]: Finished difference Result 624 states and 842 transitions. [2024-10-12 18:30:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 18:30:42,937 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 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 36 [2024-10-12 18:30:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:42,939 INFO L225 Difference]: With dead ends: 624 [2024-10-12 18:30:42,939 INFO L226 Difference]: Without dead ends: 568 [2024-10-12 18:30:42,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2024-10-12 18:30:42,940 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 666 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:42,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 560 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 18:30:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-12 18:30:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 461. [2024-10-12 18:30:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.3630434782608696) internal successors, (627), 460 states have internal predecessors, (627), 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-10-12 18:30:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 627 transitions. [2024-10-12 18:30:42,953 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 627 transitions. Word has length 36 [2024-10-12 18:30:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:42,953 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 627 transitions. [2024-10-12 18:30:42,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 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-10-12 18:30:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 627 transitions. [2024-10-12 18:30:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 18:30:42,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:42,954 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:42,959 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-10-12 18:30:43,154 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-10-12 18:30:43,155 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:43,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash -992009927, now seen corresponding path program 1 times [2024-10-12 18:30:43,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:43,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632723859] [2024-10-12 18:30:43,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:43,156 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-10-12 18:30:43,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:43,159 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-10-12 18:30:43,160 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-10-12 18:30:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:43,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 18:30:43,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-12 18:30:43,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-12 18:30:43,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:43,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632723859] [2024-10-12 18:30:43,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632723859] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:43,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:43,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-10-12 18:30:43,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223738542] [2024-10-12 18:30:43,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:43,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:30:43,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:43,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:30:43,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:30:43,326 INFO L87 Difference]: Start difference. First operand 461 states and 627 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-10-12 18:30:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:43,470 INFO L93 Difference]: Finished difference Result 763 states and 1029 transitions. [2024-10-12 18:30:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 18:30:43,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-10-12 18:30:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:43,473 INFO L225 Difference]: With dead ends: 763 [2024-10-12 18:30:43,473 INFO L226 Difference]: Without dead ends: 430 [2024-10-12 18:30:43,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 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-10-12 18:30:43,474 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 93 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:43,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 319 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:30:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-10-12 18:30:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 422. [2024-10-12 18:30:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.33729216152019) internal successors, (563), 421 states have internal predecessors, (563), 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-10-12 18:30:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 563 transitions. [2024-10-12 18:30:43,487 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 563 transitions. Word has length 37 [2024-10-12 18:30:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:43,487 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 563 transitions. [2024-10-12 18:30:43,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-10-12 18:30:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 563 transitions. [2024-10-12 18:30:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:30:43,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:43,488 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:43,492 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 (16)] Ended with exit code 0 [2024-10-12 18:30:43,688 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-10-12 18:30:43,689 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:43,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1796461186, now seen corresponding path program 1 times [2024-10-12 18:30:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885648200] [2024-10-12 18:30:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:43,690 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-10-12 18:30:43,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:43,693 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-10-12 18:30:43,693 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-10-12 18:30:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:43,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 18:30:43,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 18:30:43,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:30:43,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885648200] [2024-10-12 18:30:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885648200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:30:43,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:30:43,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:30:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096724316] [2024-10-12 18:30:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:30:43,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:30:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:30:43,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:30:43,777 INFO L87 Difference]: Start difference. First operand 422 states and 563 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-10-12 18:30:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:43,817 INFO L93 Difference]: Finished difference Result 692 states and 931 transitions. [2024-10-12 18:30:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:30:43,818 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 38 [2024-10-12 18:30:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:43,820 INFO L225 Difference]: With dead ends: 692 [2024-10-12 18:30:43,820 INFO L226 Difference]: Without dead ends: 444 [2024-10-12 18:30:43,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-10-12 18:30:43,821 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:43,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:30:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-12 18:30:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 432. [2024-10-12 18:30:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 1.3294663573085848) internal successors, (573), 431 states have internal predecessors, (573), 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-10-12 18:30:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 573 transitions. [2024-10-12 18:30:43,832 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 573 transitions. Word has length 38 [2024-10-12 18:30:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:43,832 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 573 transitions. [2024-10-12 18:30:43,832 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-10-12 18:30:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 573 transitions. [2024-10-12 18:30:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:30:43,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:43,833 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:43,837 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-10-12 18:30:44,036 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-10-12 18:30:44,037 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:44,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:44,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1116402816, now seen corresponding path program 1 times [2024-10-12 18:30:44,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:44,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492933733] [2024-10-12 18:30:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:44,038 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-10-12 18:30:44,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:44,040 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-10-12 18:30:44,041 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-10-12 18:30:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:44,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 18:30:44,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:44,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:44,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:44,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492933733] [2024-10-12 18:30:44,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492933733] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:44,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:44,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-12 18:30:44,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865808198] [2024-10-12 18:30:44,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:44,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:30:44,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:44,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:30:44,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:30:44,414 INFO L87 Difference]: Start difference. First operand 432 states and 573 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 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-10-12 18:30:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:45,764 INFO L93 Difference]: Finished difference Result 1312 states and 1733 transitions. [2024-10-12 18:30:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 18:30:45,765 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 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 38 [2024-10-12 18:30:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:45,769 INFO L225 Difference]: With dead ends: 1312 [2024-10-12 18:30:45,769 INFO L226 Difference]: Without dead ends: 995 [2024-10-12 18:30:45,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2024-10-12 18:30:45,770 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 828 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:45,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 692 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 18:30:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2024-10-12 18:30:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 652. [2024-10-12 18:30:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 1.3302611367127497) internal successors, (866), 651 states have internal predecessors, (866), 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-10-12 18:30:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 866 transitions. [2024-10-12 18:30:45,795 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 866 transitions. Word has length 38 [2024-10-12 18:30:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:45,795 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 866 transitions. [2024-10-12 18:30:45,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 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-10-12 18:30:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 866 transitions. [2024-10-12 18:30:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:30:45,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:45,796 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:45,801 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 (18)] Forceful destruction successful, exit code 0 [2024-10-12 18:30:45,997 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-10-12 18:30:45,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:45,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1116343234, now seen corresponding path program 1 times [2024-10-12 18:30:45,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:45,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121566278] [2024-10-12 18:30:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:45,998 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-10-12 18:30:45,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:46,001 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-10-12 18:30:46,009 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-10-12 18:30:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:46,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 18:30:46,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:46,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:46,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121566278] [2024-10-12 18:30:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121566278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:46,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-10-12 18:30:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973651709] [2024-10-12 18:30:46,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:46,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 18:30:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:46,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 18:30:46,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-12 18:30:46,442 INFO L87 Difference]: Start difference. First operand 652 states and 866 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 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-10-12 18:30:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:48,592 INFO L93 Difference]: Finished difference Result 2239 states and 2970 transitions. [2024-10-12 18:30:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-12 18:30:48,593 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 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 38 [2024-10-12 18:30:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:48,600 INFO L225 Difference]: With dead ends: 2239 [2024-10-12 18:30:48,600 INFO L226 Difference]: Without dead ends: 2237 [2024-10-12 18:30:48,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 18:30:48,601 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 593 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:48,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 934 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 18:30:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2024-10-12 18:30:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 726. [2024-10-12 18:30:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.3448275862068966) internal successors, (975), 725 states have internal predecessors, (975), 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-10-12 18:30:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 975 transitions. [2024-10-12 18:30:48,633 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 975 transitions. Word has length 38 [2024-10-12 18:30:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:48,634 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 975 transitions. [2024-10-12 18:30:48,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 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-10-12 18:30:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 975 transitions. [2024-10-12 18:30:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:30:48,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:48,635 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:48,638 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-10-12 18:30:48,835 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-10-12 18:30:48,836 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:48,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:48,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1703208830, now seen corresponding path program 1 times [2024-10-12 18:30:48,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:48,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514731789] [2024-10-12 18:30:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:48,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-10-12 18:30:48,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:48,841 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-10-12 18:30:48,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-12 18:30:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:30:48,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 18:30:48,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:30:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:49,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:30:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 18:30:49,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 18:30:49,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514731789] [2024-10-12 18:30:49,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514731789] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:30:49,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:30:49,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-12 18:30:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664434390] [2024-10-12 18:30:49,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:30:49,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 18:30:49,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 18:30:49,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 18:30:49,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:30:49,297 INFO L87 Difference]: Start difference. First operand 726 states and 975 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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-10-12 18:30:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:30:52,601 INFO L93 Difference]: Finished difference Result 2639 states and 3494 transitions. [2024-10-12 18:30:52,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-12 18:30:52,601 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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 38 [2024-10-12 18:30:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:30:52,615 INFO L225 Difference]: With dead ends: 2639 [2024-10-12 18:30:52,618 INFO L226 Difference]: Without dead ends: 2637 [2024-10-12 18:30:52,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2024-10-12 18:30:52,621 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 652 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:30:52,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 907 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 18:30:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2024-10-12 18:30:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 879. [2024-10-12 18:30:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.3519362186788155) internal successors, (1187), 878 states have internal predecessors, (1187), 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-10-12 18:30:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1187 transitions. [2024-10-12 18:30:52,695 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1187 transitions. Word has length 38 [2024-10-12 18:30:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:30:52,695 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1187 transitions. [2024-10-12 18:30:52,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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-10-12 18:30:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1187 transitions. [2024-10-12 18:30:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:30:52,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:30:52,696 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 18:30:52,705 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 (20)] Forceful destruction successful, exit code 0 [2024-10-12 18:30:52,900 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-10-12 18:30:52,900 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:30:52,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:30:52,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1703149248, now seen corresponding path program 1 times [2024-10-12 18:30:52,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 18:30:52,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716383500] [2024-10-12 18:30:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:30:52,901 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-10-12 18:30:52,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 18:30:52,904 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-10-12 18:30:52,906 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-10-12 18:30:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:30:53,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:30:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:30:53,152 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-12 18:30:53,153 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:30:53,154 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:30:53,162 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-10-12 18:30:53,355 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-10-12 18:30:53,358 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:30:53,407 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:30:53,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:30:53 BoogieIcfgContainer [2024-10-12 18:30:53,410 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:30:53,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:30:53,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:30:53,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:30:53,411 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:30:32" (3/4) ... [2024-10-12 18:30:53,413 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 18:30:53,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:30:53,415 INFO L158 Benchmark]: Toolchain (without parser) took 21591.33ms. Allocated memory was 65.0MB in the beginning and 176.2MB in the end (delta: 111.1MB). Free memory was 31.2MB in the beginning and 87.7MB in the end (delta: -56.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-12 18:30:53,418 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 48.2MB. Free memory was 29.4MB in the beginning and 29.4MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:30:53,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.98ms. Allocated memory is still 65.0MB. Free memory was 31.1MB in the beginning and 32.8MB in the end (delta: -1.8MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-10-12 18:30:53,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.05ms. Allocated memory is still 65.0MB. Free memory was 32.8MB in the beginning and 31.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:30:53,419 INFO L158 Benchmark]: Boogie Preprocessor took 74.15ms. Allocated memory is still 65.0MB. Free memory was 30.8MB in the beginning and 28.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:30:53,419 INFO L158 Benchmark]: RCFGBuilder took 566.25ms. Allocated memory is still 65.0MB. Free memory was 28.3MB in the beginning and 26.7MB in the end (delta: 1.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 18:30:53,419 INFO L158 Benchmark]: TraceAbstraction took 20498.23ms. Allocated memory was 65.0MB in the beginning and 176.2MB in the end (delta: 111.1MB). Free memory was 26.1MB in the beginning and 87.7MB in the end (delta: -61.6MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-10-12 18:30:53,419 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 176.2MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:30:53,420 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 48.2MB. Free memory was 29.4MB in the beginning and 29.4MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.98ms. Allocated memory is still 65.0MB. Free memory was 31.1MB in the beginning and 32.8MB in the end (delta: -1.8MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.05ms. Allocated memory is still 65.0MB. Free memory was 32.8MB in the beginning and 31.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.15ms. Allocated memory is still 65.0MB. Free memory was 30.8MB in the beginning and 28.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.25ms. Allocated memory is still 65.0MB. Free memory was 28.3MB in the beginning and 26.7MB in the end (delta: 1.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20498.23ms. Allocated memory was 65.0MB in the beginning and 176.2MB in the end (delta: 111.1MB). Free memory was 26.1MB in the beginning and 87.7MB in the end (delta: -61.6MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 176.2MB. Free memory is still 87.7MB. 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3995 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3995 mSDsluCounter, 5674 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4780 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4482 IncrementalHoareTripleChecker+Invalid, 4768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 894 mSDtfsCounter, 4482 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1003 GetRequests, 754 SyntacticMatches, 1 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=19, InterpolantAutomatonStates: 237, 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, 19 MinimizatonAttempts, 4247 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 619 NumberOfCodeBlocks, 593 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 881 ConstructedInterpolants, 0 QuantifiedInterpolants, 2956 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1812 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 29 InterpolantComputations, 9 PerfectInterpolantSequences, 651/755 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-10-12 18:30:53,456 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