./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:20:27,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:20:27,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:20:27,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:20:27,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:20:27,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:20:27,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:20:27,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:20:27,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:20:27,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:20:27,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:20:27,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:20:27,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:20:27,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:20:27,292 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:20:27,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:20:27,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:20:27,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:20:27,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:20:27,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:20:27,295 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:20:27,295 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:20:27,295 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:20:27,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:20:27,296 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:20:27,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:20:27,296 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:20:27,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:20:27,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:20:27,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:20:27,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:20:27,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:20:27,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:20:27,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:20:27,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:20:27,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:20:27,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:20:27,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:20:27,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:20:27,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:20:27,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:20:27,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:20:27,301 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2024-10-24 16:20:27,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:20:27,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:20:27,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:20:27,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:20:27,534 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:20:27,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-10-24 16:20:28,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:20:29,166 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:20:29,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-10-24 16:20:29,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38597e750/51861fa198ea458885b6334a66311ebe/FLAGd420240bd [2024-10-24 16:20:29,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38597e750/51861fa198ea458885b6334a66311ebe [2024-10-24 16:20:29,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:20:29,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:20:29,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:20:29,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:20:29,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:20:29,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0158b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29, skipping insertion in model container [2024-10-24 16:20:29,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:20:29,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:20:29,566 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:20:29,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:20:29,785 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:20:29,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29 WrapperNode [2024-10-24 16:20:29,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:20:29,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:20:29,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:20:29,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:20:29,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,851 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2024-10-24 16:20:29,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:20:29,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:20:29,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:20:29,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:20:29,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,896 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 9, 6]. The 0 writes are split as follows [0, 0, 0]. [2024-10-24 16:20:29,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:20:29,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:20:29,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:20:29,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:20:29,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (1/1) ... [2024-10-24 16:20:29,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:20:29,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:29,964 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-24 16:20:29,967 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-24 16:20:30,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:20:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:20:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 16:20:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-24 16:20:30,022 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-24 16:20:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:20:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:20:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:20:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:20:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 16:20:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:20:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:20:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:20:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 16:20:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:20:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:20:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 16:20:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:20:30,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:20:30,187 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:20:30,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:20:30,530 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-24 16:20:30,530 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:20:30,578 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:20:30,579 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 16:20:30,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:20:30 BoogieIcfgContainer [2024-10-24 16:20:30,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:20:30,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:20:30,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:20:30,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:20:30,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:20:29" (1/3) ... [2024-10-24 16:20:30,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cd401c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:20:30, skipping insertion in model container [2024-10-24 16:20:30,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:20:29" (2/3) ... [2024-10-24 16:20:30,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cd401c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:20:30, skipping insertion in model container [2024-10-24 16:20:30,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:20:30" (3/3) ... [2024-10-24 16:20:30,594 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2024-10-24 16:20:30,615 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:20:30,619 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-24 16:20:30,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:20:30,697 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=None, 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;@8215f54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:20:30,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-24 16:20:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:20:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:20:30,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:30,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:20:30,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:30,729 INFO L85 PathProgramCache]: Analyzing trace with hash 131378568, now seen corresponding path program 1 times [2024-10-24 16:20:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588128348] [2024-10-24 16:20:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:31,211 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-24 16:20:31,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:31,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588128348] [2024-10-24 16:20:31,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588128348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:31,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:31,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:20:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293419259] [2024-10-24 16:20:31,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:31,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:20:31,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:20:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:20:31,275 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:31,368 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2024-10-24 16:20:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:20:31,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:20:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:31,376 INFO L225 Difference]: With dead ends: 117 [2024-10-24 16:20:31,376 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 16:20:31,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:20:31,379 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 143 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:31,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 100 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 16:20:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2024-10-24 16:20:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.65) internal successors, (99), 77 states have internal predecessors, (99), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-24 16:20:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2024-10-24 16:20:31,416 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 5 [2024-10-24 16:20:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:31,417 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2024-10-24 16:20:31,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2024-10-24 16:20:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:20:31,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:31,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:20:31,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:20:31,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:31,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash 131378569, now seen corresponding path program 1 times [2024-10-24 16:20:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:31,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181794805] [2024-10-24 16:20:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:31,571 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-24 16:20:31,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181794805] [2024-10-24 16:20:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181794805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:31,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:31,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:20:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945969364] [2024-10-24 16:20:31,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:31,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:20:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:20:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:20:31,575 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:31,664 INFO L93 Difference]: Finished difference Result 186 states and 250 transitions. [2024-10-24 16:20:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:20:31,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:20:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:31,666 INFO L225 Difference]: With dead ends: 186 [2024-10-24 16:20:31,668 INFO L226 Difference]: Without dead ends: 186 [2024-10-24 16:20:31,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:20:31,669 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 88 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:31,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 193 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-24 16:20:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 160. [2024-10-24 16:20:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.6666666666666667) internal successors, (210), 143 states have internal predecessors, (210), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-24 16:20:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 246 transitions. [2024-10-24 16:20:31,692 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 246 transitions. Word has length 5 [2024-10-24 16:20:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:31,692 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 246 transitions. [2024-10-24 16:20:31,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 246 transitions. [2024-10-24 16:20:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:20:31,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:31,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:20:31,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:20:31,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:31,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash -222231707, now seen corresponding path program 1 times [2024-10-24 16:20:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781980634] [2024-10-24 16:20:31,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:31,910 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-24 16:20:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:31,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781980634] [2024-10-24 16:20:31,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781980634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:31,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:31,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:20:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349687269] [2024-10-24 16:20:31,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:31,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:20:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:31,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:20:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:20:31,915 INFO L87 Difference]: Start difference. First operand 160 states and 246 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:32,047 INFO L93 Difference]: Finished difference Result 205 states and 295 transitions. [2024-10-24 16:20:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:20:32,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 16:20:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:32,049 INFO L225 Difference]: With dead ends: 205 [2024-10-24 16:20:32,049 INFO L226 Difference]: Without dead ends: 205 [2024-10-24 16:20:32,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:20:32,050 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 79 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:32,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 156 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:32,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-24 16:20:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2024-10-24 16:20:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 146 states have internal predecessors, (213), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-24 16:20:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 249 transitions. [2024-10-24 16:20:32,071 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 249 transitions. Word has length 6 [2024-10-24 16:20:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:32,072 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 249 transitions. [2024-10-24 16:20:32,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 249 transitions. [2024-10-24 16:20:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:20:32,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:32,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:32,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:20:32,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:32,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1700751720, now seen corresponding path program 1 times [2024-10-24 16:20:32,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:32,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682270477] [2024-10-24 16:20:32,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:32,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:32,269 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-24 16:20:32,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:32,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682270477] [2024-10-24 16:20:32,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682270477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:32,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:32,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:20:32,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033219756] [2024-10-24 16:20:32,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:32,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:20:32,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:32,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:20:32,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:20:32,271 INFO L87 Difference]: Start difference. First operand 163 states and 249 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:32,379 INFO L93 Difference]: Finished difference Result 188 states and 251 transitions. [2024-10-24 16:20:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:20:32,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 16:20:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:32,381 INFO L225 Difference]: With dead ends: 188 [2024-10-24 16:20:32,381 INFO L226 Difference]: Without dead ends: 188 [2024-10-24 16:20:32,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:20:32,382 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 69 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:32,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 187 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-24 16:20:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2024-10-24 16:20:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 146 states have internal predecessors, (211), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-24 16:20:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2024-10-24 16:20:32,397 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 7 [2024-10-24 16:20:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:32,397 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2024-10-24 16:20:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2024-10-24 16:20:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 16:20:32,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:32,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:32,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:20:32,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:32,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1183695815, now seen corresponding path program 1 times [2024-10-24 16:20:32,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915407451] [2024-10-24 16:20:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:32,471 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-24 16:20:32,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:32,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915407451] [2024-10-24 16:20:32,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915407451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:32,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:32,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:20:32,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791906848] [2024-10-24 16:20:32,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:32,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:20:32,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:32,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:20:32,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:20:32,473 INFO L87 Difference]: Start difference. First operand 163 states and 247 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:32,551 INFO L93 Difference]: Finished difference Result 245 states and 337 transitions. [2024-10-24 16:20:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:20:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 16:20:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:32,553 INFO L225 Difference]: With dead ends: 245 [2024-10-24 16:20:32,553 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 16:20:32,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:20:32,554 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 131 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:32,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 174 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 16:20:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 196. [2024-10-24 16:20:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.60625) internal successors, (257), 178 states have internal predecessors, (257), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-24 16:20:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 293 transitions. [2024-10-24 16:20:32,572 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 293 transitions. Word has length 8 [2024-10-24 16:20:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:32,572 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 293 transitions. [2024-10-24 16:20:32,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 293 transitions. [2024-10-24 16:20:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:20:32,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:32,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:32,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:20:32,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:32,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:32,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1960135350, now seen corresponding path program 1 times [2024-10-24 16:20:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:32,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385948752] [2024-10-24 16:20:32,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:32,660 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-24 16:20:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:32,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385948752] [2024-10-24 16:20:32,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385948752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:32,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:20:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317058056] [2024-10-24 16:20:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:32,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:20:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:20:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:20:32,662 INFO L87 Difference]: Start difference. First operand 196 states and 293 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:32,735 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2024-10-24 16:20:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:20:32,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 16:20:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:32,737 INFO L225 Difference]: With dead ends: 244 [2024-10-24 16:20:32,737 INFO L226 Difference]: Without dead ends: 244 [2024-10-24 16:20:32,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:20:32,738 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 138 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:32,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-24 16:20:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2024-10-24 16:20:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 173 states have (on average 1.606936416184971) internal successors, (278), 192 states have internal predecessors, (278), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-24 16:20:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 314 transitions. [2024-10-24 16:20:32,744 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 314 transitions. Word has length 9 [2024-10-24 16:20:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:32,744 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 314 transitions. [2024-10-24 16:20:32,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 314 transitions. [2024-10-24 16:20:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:20:32,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:32,745 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:32,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:20:32,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:32,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash -519071088, now seen corresponding path program 1 times [2024-10-24 16:20:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704921477] [2024-10-24 16:20:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:32,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:32,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:32,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704921477] [2024-10-24 16:20:32,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704921477] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:32,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909077932] [2024-10-24 16:20:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:32,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:32,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:32,838 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-24 16:20:32,850 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-24 16:20:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:32,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:20:32,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:33,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:33,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909077932] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:20:33,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:20:33,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-10-24 16:20:33,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109339054] [2024-10-24 16:20:33,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:33,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:20:33,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:33,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:20:33,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:20:33,295 INFO L87 Difference]: Start difference. First operand 210 states and 314 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:33,587 INFO L93 Difference]: Finished difference Result 236 states and 313 transitions. [2024-10-24 16:20:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:20:33,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 16:20:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:33,589 INFO L225 Difference]: With dead ends: 236 [2024-10-24 16:20:33,589 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 16:20:33,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:20:33,590 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 155 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:33,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 426 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:20:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 16:20:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 213. [2024-10-24 16:20:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 195 states have internal predecessors, (272), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-24 16:20:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2024-10-24 16:20:33,596 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 13 [2024-10-24 16:20:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:33,596 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2024-10-24 16:20:33,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2024-10-24 16:20:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:20:33,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:33,597 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:33,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:33,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:33,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:33,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1088665406, now seen corresponding path program 1 times [2024-10-24 16:20:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706581692] [2024-10-24 16:20:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:33,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706581692] [2024-10-24 16:20:33,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706581692] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:33,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707209877] [2024-10-24 16:20:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:33,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:33,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:33,938 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-24 16:20:33,939 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-24 16:20:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:33,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:20:33,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:34,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707209877] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:20:34,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:20:34,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2024-10-24 16:20:34,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770948141] [2024-10-24 16:20:34,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:34,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 16:20:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:34,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 16:20:34,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:20:34,169 INFO L87 Difference]: Start difference. First operand 213 states and 308 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:34,348 INFO L93 Difference]: Finished difference Result 256 states and 353 transitions. [2024-10-24 16:20:34,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:20:34,349 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 16:20:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:34,350 INFO L225 Difference]: With dead ends: 256 [2024-10-24 16:20:34,350 INFO L226 Difference]: Without dead ends: 256 [2024-10-24 16:20:34,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:20:34,351 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 102 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:34,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 309 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-24 16:20:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 221. [2024-10-24 16:20:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 203 states have internal predecessors, (283), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-24 16:20:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 319 transitions. [2024-10-24 16:20:34,357 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 319 transitions. Word has length 14 [2024-10-24 16:20:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:34,357 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 319 transitions. [2024-10-24 16:20:34,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 319 transitions. [2024-10-24 16:20:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:20:34,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:34,358 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:34,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:20:34,560 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,SelfDestructingSolverStorable7 [2024-10-24 16:20:34,560 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:34,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash -611110737, now seen corresponding path program 1 times [2024-10-24 16:20:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:34,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844915490] [2024-10-24 16:20:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:34,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:34,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:34,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844915490] [2024-10-24 16:20:34,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844915490] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:34,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848333292] [2024-10-24 16:20:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:34,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:34,698 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-24 16:20:34,699 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-24 16:20:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:34,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:20:34,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:34,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:34,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848333292] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:20:34,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:20:34,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-10-24 16:20:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609972128] [2024-10-24 16:20:34,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:34,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:20:34,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:20:34,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:20:34,994 INFO L87 Difference]: Start difference. First operand 221 states and 319 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:35,395 INFO L93 Difference]: Finished difference Result 355 states and 471 transitions. [2024-10-24 16:20:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:20:35,395 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 16:20:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:35,397 INFO L225 Difference]: With dead ends: 355 [2024-10-24 16:20:35,397 INFO L226 Difference]: Without dead ends: 355 [2024-10-24 16:20:35,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-10-24 16:20:35,397 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 254 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:35,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 640 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:20:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-24 16:20:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 292. [2024-10-24 16:20:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 251 states have (on average 1.5577689243027888) internal successors, (391), 272 states have internal predecessors, (391), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-24 16:20:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 434 transitions. [2024-10-24 16:20:35,404 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 434 transitions. Word has length 15 [2024-10-24 16:20:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:35,404 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 434 transitions. [2024-10-24 16:20:35,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 434 transitions. [2024-10-24 16:20:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:20:35,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:35,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:35,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 16:20:35,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:35,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:35,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:35,610 INFO L85 PathProgramCache]: Analyzing trace with hash -905176023, now seen corresponding path program 1 times [2024-10-24 16:20:35,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:35,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023161706] [2024-10-24 16:20:35,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:35,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:35,645 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-24 16:20:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:35,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023161706] [2024-10-24 16:20:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023161706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:35,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:35,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:20:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158248062] [2024-10-24 16:20:35,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:35,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:20:35,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:35,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:20:35,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:20:35,647 INFO L87 Difference]: Start difference. First operand 292 states and 434 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:35,667 INFO L93 Difference]: Finished difference Result 428 states and 642 transitions. [2024-10-24 16:20:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:20:35,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 16:20:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:35,670 INFO L225 Difference]: With dead ends: 428 [2024-10-24 16:20:35,671 INFO L226 Difference]: Without dead ends: 428 [2024-10-24 16:20:35,671 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-24 16:20:35,671 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:35,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 98 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:20:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-24 16:20:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 411. [2024-10-24 16:20:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 361 states have (on average 1.5650969529085872) internal successors, (565), 384 states have internal predecessors, (565), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2024-10-24 16:20:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 634 transitions. [2024-10-24 16:20:35,687 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 634 transitions. Word has length 16 [2024-10-24 16:20:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:35,687 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 634 transitions. [2024-10-24 16:20:35,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 634 transitions. [2024-10-24 16:20:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:20:35,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:35,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:35,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:20:35,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:35,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:35,689 INFO L85 PathProgramCache]: Analyzing trace with hash -905175767, now seen corresponding path program 1 times [2024-10-24 16:20:35,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:35,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410199876] [2024-10-24 16:20:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:35,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:35,712 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-24 16:20:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410199876] [2024-10-24 16:20:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410199876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:35,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:35,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:20:35,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729946463] [2024-10-24 16:20:35,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:35,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:20:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:35,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:20:35,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:20:35,714 INFO L87 Difference]: Start difference. First operand 411 states and 634 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:35,724 INFO L93 Difference]: Finished difference Result 373 states and 568 transitions. [2024-10-24 16:20:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:20:35,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 16:20:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:35,727 INFO L225 Difference]: With dead ends: 373 [2024-10-24 16:20:35,727 INFO L226 Difference]: Without dead ends: 373 [2024-10-24 16:20:35,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:20:35,728 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:35,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:20:35,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-24 16:20:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-10-24 16:20:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 329 states have (on average 1.5167173252279635) internal successors, (499), 346 states have internal predecessors, (499), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2024-10-24 16:20:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 568 transitions. [2024-10-24 16:20:35,738 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 568 transitions. Word has length 16 [2024-10-24 16:20:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:35,738 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 568 transitions. [2024-10-24 16:20:35,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 568 transitions. [2024-10-24 16:20:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:20:35,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:35,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:35,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:20:35,739 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:35,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2004314431, now seen corresponding path program 1 times [2024-10-24 16:20:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:35,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896011380] [2024-10-24 16:20:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:35,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:35,782 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-24 16:20:35,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:35,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896011380] [2024-10-24 16:20:35,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896011380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:35,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:35,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:20:35,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158755385] [2024-10-24 16:20:35,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:35,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:20:35,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:35,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:20:35,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:20:35,784 INFO L87 Difference]: Start difference. First operand 373 states and 568 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:35,810 INFO L93 Difference]: Finished difference Result 439 states and 648 transitions. [2024-10-24 16:20:35,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:20:35,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-24 16:20:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:35,812 INFO L225 Difference]: With dead ends: 439 [2024-10-24 16:20:35,812 INFO L226 Difference]: Without dead ends: 439 [2024-10-24 16:20:35,812 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-24 16:20:35,813 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 31 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:35,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:20:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-24 16:20:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 422. [2024-10-24 16:20:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 374 states have (on average 1.5106951871657754) internal successors, (565), 393 states have internal predecessors, (565), 16 states have call successors, (16), 12 states have call predecessors, (16), 20 states have return successors, (57), 16 states have call predecessors, (57), 16 states have call successors, (57) [2024-10-24 16:20:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 638 transitions. [2024-10-24 16:20:35,827 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 638 transitions. Word has length 17 [2024-10-24 16:20:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:35,829 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 638 transitions. [2024-10-24 16:20:35,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:20:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 638 transitions. [2024-10-24 16:20:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:20:35,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:35,830 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:35,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 16:20:35,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:35,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1348043702, now seen corresponding path program 1 times [2024-10-24 16:20:35,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:35,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475515477] [2024-10-24 16:20:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:35,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:35,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:35,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:35,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475515477] [2024-10-24 16:20:35,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475515477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:35,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:20:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582416555] [2024-10-24 16:20:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:35,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:20:35,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:35,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:20:35,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:20:35,893 INFO L87 Difference]: Start difference. First operand 422 states and 638 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:35,938 INFO L93 Difference]: Finished difference Result 300 states and 427 transitions. [2024-10-24 16:20:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:20:35,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 16:20:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:35,939 INFO L225 Difference]: With dead ends: 300 [2024-10-24 16:20:35,939 INFO L226 Difference]: Without dead ends: 300 [2024-10-24 16:20:35,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-24 16:20:35,940 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:35,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:20:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-24 16:20:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2024-10-24 16:20:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.4765625) internal successors, (378), 274 states have internal predecessors, (378), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-24 16:20:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2024-10-24 16:20:35,946 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 23 [2024-10-24 16:20:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:35,946 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2024-10-24 16:20:35,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2024-10-24 16:20:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:20:35,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:35,947 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:35,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 16:20:35,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:35,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -780593392, now seen corresponding path program 1 times [2024-10-24 16:20:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71582796] [2024-10-24 16:20:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:35,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:36,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:36,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71582796] [2024-10-24 16:20:36,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71582796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:36,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:20:36,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:20:36,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629910554] [2024-10-24 16:20:36,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:36,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:20:36,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:36,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:20:36,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:20:36,027 INFO L87 Difference]: Start difference. First operand 294 states and 421 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:36,150 INFO L93 Difference]: Finished difference Result 313 states and 435 transitions. [2024-10-24 16:20:36,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:20:36,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-24 16:20:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:36,152 INFO L225 Difference]: With dead ends: 313 [2024-10-24 16:20:36,152 INFO L226 Difference]: Without dead ends: 313 [2024-10-24 16:20:36,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:20:36,153 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 102 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:36,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 127 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:36,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-24 16:20:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 294. [2024-10-24 16:20:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.46484375) internal successors, (375), 274 states have internal predecessors, (375), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-24 16:20:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 418 transitions. [2024-10-24 16:20:36,158 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 418 transitions. Word has length 25 [2024-10-24 16:20:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:36,158 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 418 transitions. [2024-10-24 16:20:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 418 transitions. [2024-10-24 16:20:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:20:36,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:36,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:36,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 16:20:36,160 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:36,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1173620402, now seen corresponding path program 1 times [2024-10-24 16:20:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:36,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448493834] [2024-10-24 16:20:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:36,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:36,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:36,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448493834] [2024-10-24 16:20:36,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448493834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:36,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997282746] [2024-10-24 16:20:36,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:36,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:36,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:36,383 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-24 16:20:36,385 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-24 16:20:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:36,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 16:20:36,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:36,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:20:36,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:20:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:36,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:36,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997282746] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:36,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:36,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2024-10-24 16:20:36,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772800920] [2024-10-24 16:20:36,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:36,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:20:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:20:36,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:20:36,832 INFO L87 Difference]: Start difference. First operand 294 states and 418 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:20:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:37,145 INFO L93 Difference]: Finished difference Result 310 states and 419 transitions. [2024-10-24 16:20:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:20:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-24 16:20:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:37,147 INFO L225 Difference]: With dead ends: 310 [2024-10-24 16:20:37,148 INFO L226 Difference]: Without dead ends: 310 [2024-10-24 16:20:37,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2024-10-24 16:20:37,150 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 386 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:37,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 80 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:20:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-24 16:20:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 298. [2024-10-24 16:20:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.4192307692307693) internal successors, (369), 278 states have internal predecessors, (369), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-24 16:20:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 412 transitions. [2024-10-24 16:20:37,156 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 412 transitions. Word has length 25 [2024-10-24 16:20:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:37,156 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 412 transitions. [2024-10-24 16:20:37,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:20:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 412 transitions. [2024-10-24 16:20:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:20:37,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:37,158 INFO L215 NwaCegarLoop]: trace histogram [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-24 16:20:37,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 16:20:37,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 16:20:37,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:37,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:37,363 INFO L85 PathProgramCache]: Analyzing trace with hash -177446873, now seen corresponding path program 1 times [2024-10-24 16:20:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574953283] [2024-10-24 16:20:37,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:37,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:37,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:37,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:37,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574953283] [2024-10-24 16:20:37,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574953283] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:37,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785527587] [2024-10-24 16:20:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:37,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:37,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:37,511 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-24 16:20:37,512 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-24 16:20:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:37,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:20:37,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:37,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:20:37,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785527587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:37,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:20:37,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2024-10-24 16:20:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016892241] [2024-10-24 16:20:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:37,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:20:37,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:20:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:20:37,692 INFO L87 Difference]: Start difference. First operand 298 states and 412 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:37,752 INFO L93 Difference]: Finished difference Result 312 states and 422 transitions. [2024-10-24 16:20:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:20:37,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-24 16:20:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:37,754 INFO L225 Difference]: With dead ends: 312 [2024-10-24 16:20:37,754 INFO L226 Difference]: Without dead ends: 312 [2024-10-24 16:20:37,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:20:37,754 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:37,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 100 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-24 16:20:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2024-10-24 16:20:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 266 states have (on average 1.4097744360902256) internal successors, (375), 284 states have internal predecessors, (375), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-24 16:20:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 418 transitions. [2024-10-24 16:20:37,761 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 418 transitions. Word has length 26 [2024-10-24 16:20:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:37,762 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 418 transitions. [2024-10-24 16:20:37,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 418 transitions. [2024-10-24 16:20:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:20:37,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:37,764 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:37,777 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-24 16:20:37,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 16:20:37,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:37,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1727191021, now seen corresponding path program 1 times [2024-10-24 16:20:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:37,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929973084] [2024-10-24 16:20:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:37,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:38,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:38,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929973084] [2024-10-24 16:20:38,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929973084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563723399] [2024-10-24 16:20:38,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:38,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:38,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:38,524 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-24 16:20:38,526 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-24 16:20:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:38,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 16:20:38,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:38,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:20:38,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:20:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:38,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:39,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563723399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:39,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:39,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2024-10-24 16:20:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660677889] [2024-10-24 16:20:39,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:39,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 16:20:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:39,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 16:20:39,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:20:39,058 INFO L87 Difference]: Start difference. First operand 304 states and 418 transitions. Second operand has 19 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:20:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:39,497 INFO L93 Difference]: Finished difference Result 313 states and 418 transitions. [2024-10-24 16:20:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:20:39,497 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-10-24 16:20:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:39,498 INFO L225 Difference]: With dead ends: 313 [2024-10-24 16:20:39,499 INFO L226 Difference]: Without dead ends: 313 [2024-10-24 16:20:39,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2024-10-24 16:20:39,499 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 268 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:39,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 133 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:20:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-24 16:20:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 305. [2024-10-24 16:20:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 267 states have (on average 1.3895131086142323) internal successors, (371), 285 states have internal predecessors, (371), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-24 16:20:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 414 transitions. [2024-10-24 16:20:39,506 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 414 transitions. Word has length 27 [2024-10-24 16:20:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:39,506 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 414 transitions. [2024-10-24 16:20:39,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:20:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 414 transitions. [2024-10-24 16:20:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:20:39,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:39,507 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:39,524 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-24 16:20:39,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 16:20:39,708 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:39,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2003314146, now seen corresponding path program 1 times [2024-10-24 16:20:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458457783] [2024-10-24 16:20:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:39,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:39,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:39,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458457783] [2024-10-24 16:20:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458457783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268381543] [2024-10-24 16:20:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:39,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:39,863 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-24 16:20:39,865 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-24 16:20:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:39,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 16:20:39,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:40,002 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 16:20:40,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-24 16:20:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:40,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:40,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268381543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:40,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:40,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-10-24 16:20:40,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23525740] [2024-10-24 16:20:40,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:40,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:20:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:40,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:20:40,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:20:40,076 INFO L87 Difference]: Start difference. First operand 305 states and 414 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:20:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:40,432 INFO L93 Difference]: Finished difference Result 419 states and 527 transitions. [2024-10-24 16:20:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:20:40,432 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-24 16:20:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:40,434 INFO L225 Difference]: With dead ends: 419 [2024-10-24 16:20:40,434 INFO L226 Difference]: Without dead ends: 419 [2024-10-24 16:20:40,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-10-24 16:20:40,436 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 323 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:40,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 150 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:20:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-24 16:20:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 378. [2024-10-24 16:20:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 337 states have (on average 1.3560830860534125) internal successors, (457), 356 states have internal predecessors, (457), 11 states have call successors, (11), 10 states have call predecessors, (11), 18 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-24 16:20:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 499 transitions. [2024-10-24 16:20:40,443 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 499 transitions. Word has length 28 [2024-10-24 16:20:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:40,443 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 499 transitions. [2024-10-24 16:20:40,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:20:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 499 transitions. [2024-10-24 16:20:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:20:40,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:40,444 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:40,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 16:20:40,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:40,649 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:40,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1973196431, now seen corresponding path program 1 times [2024-10-24 16:20:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397782660] [2024-10-24 16:20:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:40,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397782660] [2024-10-24 16:20:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397782660] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4266875] [2024-10-24 16:20:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:40,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:40,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:40,930 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-24 16:20:40,931 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-24 16:20:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:40,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:20:40,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:41,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:20:41,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:20:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:41,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:41,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4266875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:41,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:41,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2024-10-24 16:20:41,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622035337] [2024-10-24 16:20:41,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:41,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:20:41,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:41,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:20:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:20:41,282 INFO L87 Difference]: Start difference. First operand 378 states and 499 transitions. Second operand has 16 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:20:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:41,736 INFO L93 Difference]: Finished difference Result 507 states and 621 transitions. [2024-10-24 16:20:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:20:41,737 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-24 16:20:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:41,738 INFO L225 Difference]: With dead ends: 507 [2024-10-24 16:20:41,738 INFO L226 Difference]: Without dead ends: 507 [2024-10-24 16:20:41,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 16:20:41,739 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 538 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:41,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 176 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:20:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-10-24 16:20:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 463. [2024-10-24 16:20:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 419 states have (on average 1.334128878281623) internal successors, (559), 440 states have internal predecessors, (559), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-24 16:20:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 597 transitions. [2024-10-24 16:20:41,747 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 597 transitions. Word has length 29 [2024-10-24 16:20:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:41,747 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 597 transitions. [2024-10-24 16:20:41,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:20:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 597 transitions. [2024-10-24 16:20:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:20:41,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:41,747 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:41,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:41,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:41,948 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:41,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1854582443, now seen corresponding path program 1 times [2024-10-24 16:20:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:41,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220134167] [2024-10-24 16:20:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:41,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:42,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:42,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:42,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220134167] [2024-10-24 16:20:42,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220134167] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:42,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076077039] [2024-10-24 16:20:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:42,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:42,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:42,151 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:42,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 16:20:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:42,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:20:42,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:42,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:20:42,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:20:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:42,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:42,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076077039] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:42,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:42,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2024-10-24 16:20:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008925180] [2024-10-24 16:20:42,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:42,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:20:42,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:42,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:20:42,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:20:42,648 INFO L87 Difference]: Start difference. First operand 463 states and 597 transitions. Second operand has 18 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:20:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:43,107 INFO L93 Difference]: Finished difference Result 477 states and 590 transitions. [2024-10-24 16:20:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:20:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-24 16:20:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:43,108 INFO L225 Difference]: With dead ends: 477 [2024-10-24 16:20:43,109 INFO L226 Difference]: Without dead ends: 477 [2024-10-24 16:20:43,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2024-10-24 16:20:43,109 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 292 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:43,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 120 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:20:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-24 16:20:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 460. [2024-10-24 16:20:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 419 states have (on average 1.2840095465393795) internal successors, (538), 437 states have internal predecessors, (538), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-24 16:20:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 576 transitions. [2024-10-24 16:20:43,117 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 576 transitions. Word has length 33 [2024-10-24 16:20:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:43,117 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 576 transitions. [2024-10-24 16:20:43,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:20:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 576 transitions. [2024-10-24 16:20:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:20:43,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:43,117 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:43,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 16:20:43,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:43,322 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:43,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:43,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2145365376, now seen corresponding path program 1 times [2024-10-24 16:20:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086146901] [2024-10-24 16:20:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:20:43,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:43,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086146901] [2024-10-24 16:20:43,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086146901] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:43,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631744606] [2024-10-24 16:20:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:43,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:43,464 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:43,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 16:20:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:43,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:20:43,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:43,654 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:20:43,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:20:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 16:20:43,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:43,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-24 16:20:43,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-24 16:20:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 16:20:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631744606] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:20:43,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:20:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2024-10-24 16:20:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021402951] [2024-10-24 16:20:43,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:43,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 16:20:43,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 16:20:43,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:20:43,946 INFO L87 Difference]: Start difference. First operand 460 states and 576 transitions. Second operand has 17 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:20:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:44,255 INFO L93 Difference]: Finished difference Result 499 states and 602 transitions. [2024-10-24 16:20:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:20:44,255 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-10-24 16:20:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:44,256 INFO L225 Difference]: With dead ends: 499 [2024-10-24 16:20:44,257 INFO L226 Difference]: Without dead ends: 499 [2024-10-24 16:20:44,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-10-24 16:20:44,257 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 379 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:44,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 138 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:20:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-24 16:20:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 463. [2024-10-24 16:20:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 422 states have (on average 1.2819905213270142) internal successors, (541), 440 states have internal predecessors, (541), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2024-10-24 16:20:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 578 transitions. [2024-10-24 16:20:44,264 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 578 transitions. Word has length 34 [2024-10-24 16:20:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:44,264 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 578 transitions. [2024-10-24 16:20:44,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:20:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 578 transitions. [2024-10-24 16:20:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:20:44,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:44,265 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:44,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:44,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-24 16:20:44,466 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2081817197, now seen corresponding path program 1 times [2024-10-24 16:20:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788034002] [2024-10-24 16:20:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:44,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:44,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788034002] [2024-10-24 16:20:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788034002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878436211] [2024-10-24 16:20:44,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:44,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:44,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:44,920 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:44,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 16:20:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:44,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:20:44,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:45,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:45,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878436211] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:20:45,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:20:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2024-10-24 16:20:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753789671] [2024-10-24 16:20:45,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:45,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 16:20:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:45,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 16:20:45,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-10-24 16:20:45,435 INFO L87 Difference]: Start difference. First operand 463 states and 578 transitions. Second operand has 25 states, 22 states have (on average 4.181818181818182) internal successors, (92), 20 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:20:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:46,720 INFO L93 Difference]: Finished difference Result 666 states and 800 transitions. [2024-10-24 16:20:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-24 16:20:46,721 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.181818181818182) internal successors, (92), 20 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-10-24 16:20:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:46,723 INFO L225 Difference]: With dead ends: 666 [2024-10-24 16:20:46,723 INFO L226 Difference]: Without dead ends: 666 [2024-10-24 16:20:46,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=553, Invalid=2527, Unknown=0, NotChecked=0, Total=3080 [2024-10-24 16:20:46,725 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 851 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:46,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 335 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:20:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-24 16:20:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 468. [2024-10-24 16:20:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 429 states have (on average 1.2703962703962703) internal successors, (545), 447 states have internal predecessors, (545), 10 states have call successors, (10), 10 states have call predecessors, (10), 20 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2024-10-24 16:20:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 579 transitions. [2024-10-24 16:20:46,733 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 579 transitions. Word has length 35 [2024-10-24 16:20:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:46,733 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 579 transitions. [2024-10-24 16:20:46,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.181818181818182) internal successors, (92), 20 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:20:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 579 transitions. [2024-10-24 16:20:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 16:20:46,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:46,734 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:46,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-24 16:20:46,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-24 16:20:46,939 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:46,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash 558007675, now seen corresponding path program 1 times [2024-10-24 16:20:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279547405] [2024-10-24 16:20:46,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:46,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279547405] [2024-10-24 16:20:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279547405] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410241976] [2024-10-24 16:20:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:46,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:47,003 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:47,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-24 16:20:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:47,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:20:47,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:20:47,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:20:47,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410241976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:47,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:20:47,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-24 16:20:47,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836687503] [2024-10-24 16:20:47,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:47,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:20:47,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:47,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:20:47,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:20:47,113 INFO L87 Difference]: Start difference. First operand 468 states and 579 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:47,145 INFO L93 Difference]: Finished difference Result 281 states and 330 transitions. [2024-10-24 16:20:47,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:20:47,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2024-10-24 16:20:47,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:47,146 INFO L225 Difference]: With dead ends: 281 [2024-10-24 16:20:47,147 INFO L226 Difference]: Without dead ends: 281 [2024-10-24 16:20:47,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:20:47,147 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:47,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 98 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:20:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-24 16:20:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2024-10-24 16:20:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 249 states have (on average 1.2369477911646587) internal successors, (308), 262 states have internal predecessors, (308), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:20:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 328 transitions. [2024-10-24 16:20:47,152 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 328 transitions. Word has length 43 [2024-10-24 16:20:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:47,152 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 328 transitions. [2024-10-24 16:20:47,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 328 transitions. [2024-10-24 16:20:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 16:20:47,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:47,153 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:47,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-24 16:20:47,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-24 16:20:47,354 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:47,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash 977756381, now seen corresponding path program 1 times [2024-10-24 16:20:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:47,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440110936] [2024-10-24 16:20:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:20:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440110936] [2024-10-24 16:20:47,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440110936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184339902] [2024-10-24 16:20:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:47,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:47,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:47,439 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:47,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-24 16:20:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:47,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:20:47,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:20:47,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:20:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184339902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:47,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:20:47,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-24 16:20:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146582188] [2024-10-24 16:20:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:47,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:20:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:47,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:20:47,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:20:47,539 INFO L87 Difference]: Start difference. First operand 277 states and 328 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:47,553 INFO L93 Difference]: Finished difference Result 276 states and 325 transitions. [2024-10-24 16:20:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:20:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-24 16:20:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:47,554 INFO L225 Difference]: With dead ends: 276 [2024-10-24 16:20:47,554 INFO L226 Difference]: Without dead ends: 276 [2024-10-24 16:20:47,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 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-24 16:20:47,555 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:47,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:20:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-24 16:20:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-24 16:20:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 249 states have (on average 1.2248995983935742) internal successors, (305), 261 states have internal predecessors, (305), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:20:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 325 transitions. [2024-10-24 16:20:47,559 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 325 transitions. Word has length 44 [2024-10-24 16:20:47,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:47,559 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 325 transitions. [2024-10-24 16:20:47,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 325 transitions. [2024-10-24 16:20:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 16:20:47,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:47,560 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:47,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:47,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-24 16:20:47,764 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:47,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:47,764 INFO L85 PathProgramCache]: Analyzing trace with hash 245676811, now seen corresponding path program 1 times [2024-10-24 16:20:47,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:47,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296697811] [2024-10-24 16:20:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:20:47,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296697811] [2024-10-24 16:20:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296697811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240859166] [2024-10-24 16:20:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:47,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:47,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:47,847 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:47,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-24 16:20:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:47,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:20:47,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:20:47,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:20:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240859166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:20:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-24 16:20:47,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230025936] [2024-10-24 16:20:47,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:47,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:20:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:20:47,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:20:47,946 INFO L87 Difference]: Start difference. First operand 276 states and 325 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:47,970 INFO L93 Difference]: Finished difference Result 275 states and 321 transitions. [2024-10-24 16:20:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:20:47,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-24 16:20:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:47,971 INFO L225 Difference]: With dead ends: 275 [2024-10-24 16:20:47,972 INFO L226 Difference]: Without dead ends: 275 [2024-10-24 16:20:47,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:20:47,972 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:47,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:20:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-24 16:20:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-24 16:20:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 249 states have (on average 1.2088353413654618) internal successors, (301), 260 states have internal predecessors, (301), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:20:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 321 transitions. [2024-10-24 16:20:47,981 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 321 transitions. Word has length 45 [2024-10-24 16:20:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:47,981 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 321 transitions. [2024-10-24 16:20:47,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 321 transitions. [2024-10-24 16:20:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 16:20:47,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:47,982 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:47,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:48,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:48,184 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:48,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash -973953377, now seen corresponding path program 1 times [2024-10-24 16:20:48,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:48,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146047271] [2024-10-24 16:20:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:48,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:48,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:20:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146047271] [2024-10-24 16:20:48,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146047271] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:48,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025751883] [2024-10-24 16:20:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:48,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:48,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:48,272 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:48,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-24 16:20:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:48,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:20:48,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:48,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:20:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:20:48,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:20:48,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025751883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:20:48,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:20:48,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-24 16:20:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576676744] [2024-10-24 16:20:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:20:48,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:20:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:48,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:20:48,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:20:48,393 INFO L87 Difference]: Start difference. First operand 275 states and 321 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:48,469 INFO L93 Difference]: Finished difference Result 289 states and 329 transitions. [2024-10-24 16:20:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:20:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-24 16:20:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:48,470 INFO L225 Difference]: With dead ends: 289 [2024-10-24 16:20:48,470 INFO L226 Difference]: Without dead ends: 289 [2024-10-24 16:20:48,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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-24 16:20:48,471 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:48,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 103 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-24 16:20:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 275. [2024-10-24 16:20:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 249 states have (on average 1.1967871485943775) internal successors, (298), 260 states have internal predecessors, (298), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:20:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 318 transitions. [2024-10-24 16:20:48,476 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 318 transitions. Word has length 46 [2024-10-24 16:20:48,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:48,477 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 318 transitions. [2024-10-24 16:20:48,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:20:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 318 transitions. [2024-10-24 16:20:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 16:20:48,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:48,477 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:48,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:48,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-24 16:20:48,679 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:48,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash -169332805, now seen corresponding path program 1 times [2024-10-24 16:20:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:48,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275850169] [2024-10-24 16:20:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:48,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:20:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 16:20:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275850169] [2024-10-24 16:20:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275850169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323198844] [2024-10-24 16:20:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:48,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:48,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:48,912 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:48,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-24 16:20:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:48,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 16:20:48,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:49,056 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 16:20:49,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-24 16:20:49,117 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 16:20:49,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-24 16:20:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 16:20:49,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:49,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323198844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:49,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:49,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-10-24 16:20:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935499489] [2024-10-24 16:20:49,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:49,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:20:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:49,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:20:49,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:20:49,194 INFO L87 Difference]: Start difference. First operand 275 states and 318 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:20:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:49,495 INFO L93 Difference]: Finished difference Result 291 states and 328 transitions. [2024-10-24 16:20:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:20:49,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2024-10-24 16:20:49,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:49,497 INFO L225 Difference]: With dead ends: 291 [2024-10-24 16:20:49,497 INFO L226 Difference]: Without dead ends: 291 [2024-10-24 16:20:49,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-10-24 16:20:49,498 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 212 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:49,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 155 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:20:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-24 16:20:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2024-10-24 16:20:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 249 states have (on average 1.1847389558232932) internal successors, (295), 260 states have internal predecessors, (295), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:20:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 315 transitions. [2024-10-24 16:20:49,502 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 315 transitions. Word has length 48 [2024-10-24 16:20:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:49,502 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 315 transitions. [2024-10-24 16:20:49,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:20:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 315 transitions. [2024-10-24 16:20:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:20:49,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:49,503 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:49,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-24 16:20:49,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-24 16:20:49,707 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:49,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash -954349610, now seen corresponding path program 1 times [2024-10-24 16:20:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:49,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566867370] [2024-10-24 16:20:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:49,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:20:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:20:49,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:49,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566867370] [2024-10-24 16:20:49,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566867370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:49,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341650851] [2024-10-24 16:20:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:49,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:49,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:49,967 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:49,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-24 16:20:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:50,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 16:20:50,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:50,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:20:50,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:20:50,177 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 16:20:50,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-24 16:20:50,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:20:50,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:20:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 16:20:50,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:50,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341650851] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:50,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:50,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2024-10-24 16:20:50,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489694130] [2024-10-24 16:20:50,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:50,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:20:50,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:50,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:20:50,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-10-24 16:20:50,413 INFO L87 Difference]: Start difference. First operand 275 states and 315 transitions. Second operand has 21 states, 15 states have (on average 5.133333333333334) internal successors, (77), 14 states have internal predecessors, (77), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:20:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:50,856 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2024-10-24 16:20:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:20:50,857 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 15 states have (on average 5.133333333333334) internal successors, (77), 14 states have internal predecessors, (77), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-10-24 16:20:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:50,858 INFO L225 Difference]: With dead ends: 289 [2024-10-24 16:20:50,858 INFO L226 Difference]: Without dead ends: 289 [2024-10-24 16:20:50,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=963, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 16:20:50,858 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 296 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:50,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 227 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:20:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-24 16:20:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 274. [2024-10-24 16:20:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 249 states have (on average 1.1526104417670682) internal successors, (287), 259 states have internal predecessors, (287), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:20:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 307 transitions. [2024-10-24 16:20:50,862 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 307 transitions. Word has length 49 [2024-10-24 16:20:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:50,862 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 307 transitions. [2024-10-24 16:20:50,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 15 states have (on average 5.133333333333334) internal successors, (77), 14 states have internal predecessors, (77), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:20:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 307 transitions. [2024-10-24 16:20:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 16:20:50,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:50,863 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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-24 16:20:50,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:51,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-24 16:20:51,064 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:51,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash 139291547, now seen corresponding path program 1 times [2024-10-24 16:20:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150303290] [2024-10-24 16:20:51,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:51,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:20:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:20:51,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:51,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150303290] [2024-10-24 16:20:51,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150303290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:51,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641074375] [2024-10-24 16:20:51,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:51,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:51,212 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:51,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-24 16:20:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:51,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 16:20:51,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:51,366 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:20:51,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:20:51,492 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:20:51,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:20:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 16:20:51,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:51,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-24 16:20:51,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-24 16:20:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 16:20:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641074375] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:20:51,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:20:51,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2024-10-24 16:20:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613395217] [2024-10-24 16:20:51,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:51,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 16:20:51,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 16:20:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-10-24 16:20:51,791 INFO L87 Difference]: Start difference. First operand 274 states and 307 transitions. Second operand has 23 states, 20 states have (on average 6.45) internal successors, (129), 21 states have internal predecessors, (129), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 16:20:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:51,940 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2024-10-24 16:20:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:20:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.45) internal successors, (129), 21 states have internal predecessors, (129), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 54 [2024-10-24 16:20:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:51,941 INFO L225 Difference]: With dead ends: 284 [2024-10-24 16:20:51,941 INFO L226 Difference]: Without dead ends: 284 [2024-10-24 16:20:51,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2024-10-24 16:20:51,942 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 187 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:51,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 80 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:20:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-24 16:20:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 273. [2024-10-24 16:20:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 249 states have (on average 1.1485943775100402) internal successors, (286), 258 states have internal predecessors, (286), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:20:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 306 transitions. [2024-10-24 16:20:51,946 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 306 transitions. Word has length 54 [2024-10-24 16:20:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:51,946 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 306 transitions. [2024-10-24 16:20:51,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.45) internal successors, (129), 21 states have internal predecessors, (129), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 16:20:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 306 transitions. [2024-10-24 16:20:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 16:20:51,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:51,947 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 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-24 16:20:51,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-24 16:20:52,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-24 16:20:52,151 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:52,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:52,151 INFO L85 PathProgramCache]: Analyzing trace with hash 23070642, now seen corresponding path program 1 times [2024-10-24 16:20:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828841954] [2024-10-24 16:20:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:52,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:52,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:20:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:20:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828841954] [2024-10-24 16:20:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828841954] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395322395] [2024-10-24 16:20:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:52,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:52,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:52,585 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:52,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-24 16:20:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:52,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 16:20:52,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:52,790 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:20:52,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:20:53,014 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:20:53,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:20:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:20:53,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:53,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-10-24 16:20:53,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:20:53,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-10-24 16:20:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:20:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395322395] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:20:53,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:20:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 39 [2024-10-24 16:20:53,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661132849] [2024-10-24 16:20:53,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:53,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-24 16:20:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:53,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-24 16:20:53,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1467, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 16:20:53,568 INFO L87 Difference]: Start difference. First operand 273 states and 306 transitions. Second operand has 41 states, 35 states have (on average 3.914285714285714) internal successors, (137), 32 states have internal predecessors, (137), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:20:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:54,067 INFO L93 Difference]: Finished difference Result 284 states and 316 transitions. [2024-10-24 16:20:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:20:54,067 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 3.914285714285714) internal successors, (137), 32 states have internal predecessors, (137), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2024-10-24 16:20:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:54,068 INFO L225 Difference]: With dead ends: 284 [2024-10-24 16:20:54,068 INFO L226 Difference]: Without dead ends: 284 [2024-10-24 16:20:54,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=1986, Unknown=0, NotChecked=0, Total=2352 [2024-10-24 16:20:54,070 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 288 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:54,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 236 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:20:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-24 16:20:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 273. [2024-10-24 16:20:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 249 states have (on average 1.144578313253012) internal successors, (285), 258 states have internal predecessors, (285), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 16:20:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 305 transitions. [2024-10-24 16:20:54,073 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 305 transitions. Word has length 55 [2024-10-24 16:20:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:54,073 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 305 transitions. [2024-10-24 16:20:54,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 3.914285714285714) internal successors, (137), 32 states have internal predecessors, (137), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:20:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 305 transitions. [2024-10-24 16:20:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 16:20:54,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:54,074 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:54,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:54,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:54,275 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:54,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash 861481531, now seen corresponding path program 1 times [2024-10-24 16:20:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:54,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215730118] [2024-10-24 16:20:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:54,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:54,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:20:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:20:54,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215730118] [2024-10-24 16:20:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215730118] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588253455] [2024-10-24 16:20:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:54,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:54,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:54,682 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:54,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-24 16:20:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:54,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:20:54,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:54,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:20:54,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:20:55,168 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:20:55,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:20:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:55,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588253455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:55,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 24 [2024-10-24 16:20:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544773566] [2024-10-24 16:20:55,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:55,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 16:20:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:55,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 16:20:55,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2024-10-24 16:20:55,543 INFO L87 Difference]: Start difference. First operand 273 states and 305 transitions. Second operand has 26 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:20:56,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:56,566 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2024-10-24 16:20:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 16:20:56,566 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2024-10-24 16:20:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:56,567 INFO L225 Difference]: With dead ends: 299 [2024-10-24 16:20:56,567 INFO L226 Difference]: Without dead ends: 299 [2024-10-24 16:20:56,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=644, Invalid=2326, Unknown=0, NotChecked=0, Total=2970 [2024-10-24 16:20:56,568 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 575 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:56,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 194 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:20:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-24 16:20:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 233. [2024-10-24 16:20:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 214 states have (on average 1.1401869158878504) internal successors, (244), 220 states have internal predecessors, (244), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-24 16:20:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2024-10-24 16:20:56,572 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 55 [2024-10-24 16:20:56,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:56,572 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2024-10-24 16:20:56,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:20:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2024-10-24 16:20:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 16:20:56,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:56,573 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 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-24 16:20:56,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:56,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-24 16:20:56,778 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash 696051924, now seen corresponding path program 1 times [2024-10-24 16:20:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:56,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941998938] [2024-10-24 16:20:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:56,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:56,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:20:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:20:57,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:57,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941998938] [2024-10-24 16:20:57,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941998938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:57,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35332516] [2024-10-24 16:20:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:57,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:57,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:57,016 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:57,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-24 16:20:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:57,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 16:20:57,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:57,153 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 16:20:57,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-24 16:20:57,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:20:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:20:57,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:57,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35332516] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:57,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:20:57,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-10-24 16:20:57,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246621033] [2024-10-24 16:20:57,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:57,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:20:57,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:57,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:20:57,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:20:57,475 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand has 18 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:20:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:20:57,780 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2024-10-24 16:20:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:20:57,780 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2024-10-24 16:20:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:20:57,783 INFO L225 Difference]: With dead ends: 246 [2024-10-24 16:20:57,783 INFO L226 Difference]: Without dead ends: 246 [2024-10-24 16:20:57,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2024-10-24 16:20:57,783 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 198 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:20:57,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 149 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:20:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-24 16:20:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 232. [2024-10-24 16:20:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 214 states have (on average 1.1355140186915889) internal successors, (243), 219 states have internal predecessors, (243), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-24 16:20:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 258 transitions. [2024-10-24 16:20:57,789 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 258 transitions. Word has length 57 [2024-10-24 16:20:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:20:57,790 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 258 transitions. [2024-10-24 16:20:57,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:20:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 258 transitions. [2024-10-24 16:20:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 16:20:57,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:20:57,791 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:20:57,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-24 16:20:57,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:57,995 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:20:57,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:20:57,995 INFO L85 PathProgramCache]: Analyzing trace with hash -355197301, now seen corresponding path program 2 times [2024-10-24 16:20:57,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:20:57,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547201169] [2024-10-24 16:20:57,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:20:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:20:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:58,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:20:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:58,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:20:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:20:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:20:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:20:58,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547201169] [2024-10-24 16:20:58,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547201169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:20:58,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844552904] [2024-10-24 16:20:58,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:20:58,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:20:58,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:20:58,310 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:20:58,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-24 16:20:58,390 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:20:58,390 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:20:58,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 16:20:58,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:20:58,514 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:20:58,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:20:58,743 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:20:58,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:20:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:58,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:20:59,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-10-24 16:20:59,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:20:59,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-10-24 16:20:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:20:59,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844552904] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:20:59,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:20:59,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 42 [2024-10-24 16:20:59,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805996525] [2024-10-24 16:20:59,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:20:59,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-24 16:20:59,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:20:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-24 16:20:59,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2024-10-24 16:20:59,578 INFO L87 Difference]: Start difference. First operand 232 states and 258 transitions. Second operand has 44 states, 39 states have (on average 4.282051282051282) internal successors, (167), 36 states have internal predecessors, (167), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:21:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:00,155 INFO L93 Difference]: Finished difference Result 245 states and 271 transitions. [2024-10-24 16:21:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:21:00,155 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 4.282051282051282) internal successors, (167), 36 states have internal predecessors, (167), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2024-10-24 16:21:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:00,156 INFO L225 Difference]: With dead ends: 245 [2024-10-24 16:21:00,156 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 16:21:00,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=463, Invalid=2399, Unknown=0, NotChecked=0, Total=2862 [2024-10-24 16:21:00,157 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 323 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:00,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 227 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:21:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 16:21:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2024-10-24 16:21:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 214 states have (on average 1.1308411214953271) internal successors, (242), 218 states have internal predecessors, (242), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-24 16:21:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 257 transitions. [2024-10-24 16:21:00,164 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 257 transitions. Word has length 63 [2024-10-24 16:21:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:00,164 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 257 transitions. [2024-10-24 16:21:00,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 4.282051282051282) internal successors, (167), 36 states have internal predecessors, (167), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:21:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 257 transitions. [2024-10-24 16:21:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 16:21:00,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:00,165 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:00,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:00,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:21:00,366 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:00,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:00,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1323634330, now seen corresponding path program 1 times [2024-10-24 16:21:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:21:00,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164396892] [2024-10-24 16:21:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:00,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:21:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:21:00,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 16:21:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:21:00,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 16:21:00,434 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 16:21:00,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-10-24 16:21:00,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-10-24 16:21:00,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-10-24 16:21:00,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-10-24 16:21:00,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2024-10-24 16:21:00,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2024-10-24 16:21:00,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2024-10-24 16:21:00,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2024-10-24 16:21:00,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-10-24 16:21:00,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-10-24 16:21:00,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-10-24 16:21:00,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 16:21:00,441 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:00,499 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:21:00,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:21:00 BoogieIcfgContainer [2024-10-24 16:21:00,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:21:00,506 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:21:00,506 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:21:00,506 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:21:00,507 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:20:30" (3/4) ... [2024-10-24 16:21:00,509 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 16:21:00,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:21:00,511 INFO L158 Benchmark]: Toolchain (without parser) took 31318.73ms. Allocated memory was 165.7MB in the beginning and 337.6MB in the end (delta: 172.0MB). Free memory was 109.7MB in the beginning and 241.4MB in the end (delta: -131.7MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-10-24 16:21:00,511 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 96.7MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:21:00,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.34ms. Allocated memory is still 165.7MB. Free memory was 109.5MB in the beginning and 132.8MB in the end (delta: -23.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-10-24 16:21:00,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.34ms. Allocated memory is still 165.7MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:21:00,513 INFO L158 Benchmark]: Boogie Preprocessor took 65.20ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 128.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:21:00,513 INFO L158 Benchmark]: RCFGBuilder took 661.98ms. Allocated memory is still 165.7MB. Free memory was 128.0MB in the beginning and 108.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 16:21:00,514 INFO L158 Benchmark]: TraceAbstraction took 29922.62ms. Allocated memory was 165.7MB in the beginning and 337.6MB in the end (delta: 172.0MB). Free memory was 108.0MB in the beginning and 242.5MB in the end (delta: -134.4MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2024-10-24 16:21:00,514 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 337.6MB. Free memory was 242.5MB in the beginning and 241.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:21:00,514 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 125.8MB. Free memory was 96.7MB in the beginning and 96.7MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.34ms. Allocated memory is still 165.7MB. Free memory was 109.5MB in the beginning and 132.8MB in the end (delta: -23.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.34ms. Allocated memory is still 165.7MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.20ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 128.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 661.98ms. Allocated memory is still 165.7MB. Free memory was 128.0MB in the beginning and 108.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 29922.62ms. Allocated memory was 165.7MB in the beginning and 337.6MB in the end (delta: 172.0MB). Free memory was 108.0MB in the beginning and 242.5MB in the end (delta: -134.4MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 337.6MB. Free memory was 242.5MB in the beginning and 241.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: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L722] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={-3:0}, state=1] [L695] RET commands[i].function() [L722] RET parse_input("c1") VAL [commands={6:0}, global={-3:0}, state=1] [L723] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L706] COND TRUE \read(*global) VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L706] COND TRUE \read(*global) VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=1, commands={6:0}, global={-6:0}, state=1] [L695] RET commands[i].function() [L724] RET parse_input("c2") VAL [commands={6:0}, global={-6:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={-6:0}, state=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 29.8s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6635 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6635 mSDsluCounter, 5681 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4415 mSDsCounter, 755 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7902 IncrementalHoareTripleChecker+Invalid, 8657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 755 mSolverCounterUnsat, 1266 mSDtfsCounter, 7902 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1650 GetRequests, 1063 SyntacticMatches, 2 SemanticMatches, 585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=22, InterpolantAutomatonStates: 318, 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, 33 MinimizatonAttempts, 912 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 1876 NumberOfCodeBlocks, 1876 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 2033 ConstructedInterpolants, 159 QuantifiedInterpolants, 25137 SizeOfPredicates, 83 NumberOfNonLiveVariables, 5427 ConjunctsInSsa, 392 ConjunctsInUnsatCore, 63 InterpolantComputations, 16 PerfectInterpolantSequences, 420/1149 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-24 16:21:00,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:21:02,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:21:02,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 16:21:02,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:21:02,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:21:02,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:21:02,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:21:02,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:21:02,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:21:02,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:21:02,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:21:02,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:21:02,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:21:02,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:21:02,832 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:21:02,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:21:02,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:21:02,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:21:02,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:21:02,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:21:02,833 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:21:02,836 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:21:02,836 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:21:02,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:21:02,837 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:21:02,837 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:21:02,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:21:02,837 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:21:02,837 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:21:02,837 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:21:02,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:21:02,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:21:02,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:21:02,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:21:02,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:21:02,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:21:02,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:21:02,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:21:02,839 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:21:02,839 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:21:02,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:21:02,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:21:02,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:21:02,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:21:02,841 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:21:02,841 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2024-10-24 16:21:03,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:21:03,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:21:03,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:21:03,129 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:21:03,130 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:21:03,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-10-24 16:21:04,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:21:04,763 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:21:04,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-10-24 16:21:04,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43bd96dc8/8099d5ccb2fc45f58b0b3b77ea8bb486/FLAG7ebc80177 [2024-10-24 16:21:04,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43bd96dc8/8099d5ccb2fc45f58b0b3b77ea8bb486 [2024-10-24 16:21:04,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:21:04,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:21:04,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:21:04,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:21:04,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:21:04,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:21:04" (1/1) ... [2024-10-24 16:21:04,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b56d112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:04, skipping insertion in model container [2024-10-24 16:21:04,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:21:04" (1/1) ... [2024-10-24 16:21:04,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:21:05,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:21:05,127 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:21:05,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:21:05,222 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:21:05,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05 WrapperNode [2024-10-24 16:21:05,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:21:05,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:21:05,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:21:05,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:21:05,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,280 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2024-10-24 16:21:05,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:21:05,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:21:05,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:21:05,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:21:05,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,323 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 6, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2024-10-24 16:21:05,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:21:05,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:21:05,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:21:05,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:21:05,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (1/1) ... [2024-10-24 16:21:05,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:21:05,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:21:05,392 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-24 16:21:05,406 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-24 16:21:05,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 16:21:05,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 16:21:05,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-24 16:21:05,462 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:21:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 16:21:05,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 16:21:05,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 16:21:05,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 16:21:05,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:21:05,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:21:05,663 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:21:05,670 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:21:05,934 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-24 16:21:05,935 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:21:05,970 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:21:05,970 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 16:21:05,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:21:05 BoogieIcfgContainer [2024-10-24 16:21:05,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:21:05,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:21:05,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:21:05,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:21:05,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:21:04" (1/3) ... [2024-10-24 16:21:05,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec30f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:21:05, skipping insertion in model container [2024-10-24 16:21:05,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:05" (2/3) ... [2024-10-24 16:21:05,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec30f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:21:05, skipping insertion in model container [2024-10-24 16:21:05,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:21:05" (3/3) ... [2024-10-24 16:21:05,977 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2024-10-24 16:21:05,990 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:21:05,990 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-24 16:21:06,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:21:06,035 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=None, 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;@57ad510d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:21:06,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-24 16:21:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:21:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:21:06,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:06,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:21:06,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:06,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash 131378568, now seen corresponding path program 1 times [2024-10-24 16:21:06,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:06,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230463449] [2024-10-24 16:21:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:06,058 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-24 16:21:06,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:06,061 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-24 16:21:06,061 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-24 16:21:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:06,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:21:06,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:06,222 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-24 16:21:06,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:06,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230463449] [2024-10-24 16:21:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230463449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:06,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:06,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:21:06,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684935823] [2024-10-24 16:21:06,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:06,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:21:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:21:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:21:06,274 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:06,386 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2024-10-24 16:21:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:21:06,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:21:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:06,394 INFO L225 Difference]: With dead ends: 106 [2024-10-24 16:21:06,394 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 16:21:06,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-24 16:21:06,398 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 50 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:06,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 96 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 16:21:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 81. [2024-10-24 16:21:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 73 states have internal predecessors, (93), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:21:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-10-24 16:21:06,427 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 5 [2024-10-24 16:21:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:06,427 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-10-24 16:21:06,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-10-24 16:21:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:21:06,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:06,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:21:06,432 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-24 16:21:06,631 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-24 16:21:06,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:06,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash 131378569, now seen corresponding path program 1 times [2024-10-24 16:21:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928401133] [2024-10-24 16:21:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:06,635 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-24 16:21:06,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:06,638 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-24 16:21:06,639 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-24 16:21:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:06,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:21:06,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:06,760 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-24 16:21:06,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:06,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928401133] [2024-10-24 16:21:06,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928401133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:06,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:06,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:21:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354330055] [2024-10-24 16:21:06,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:21:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:06,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:21:06,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:21:06,763 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:06,872 INFO L93 Difference]: Finished difference Result 179 states and 235 transitions. [2024-10-24 16:21:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:21:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 16:21:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:06,874 INFO L225 Difference]: With dead ends: 179 [2024-10-24 16:21:06,874 INFO L226 Difference]: Without dead ends: 179 [2024-10-24 16:21:06,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:21:06,875 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 92 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:06,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 139 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-24 16:21:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 148. [2024-10-24 16:21:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 135 states have internal predecessors, (205), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-24 16:21:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 231 transitions. [2024-10-24 16:21:06,888 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 231 transitions. Word has length 5 [2024-10-24 16:21:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:06,888 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 231 transitions. [2024-10-24 16:21:06,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 231 transitions. [2024-10-24 16:21:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:21:06,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:06,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:21:06,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:07,089 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-24 16:21:07,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:07,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash -222231707, now seen corresponding path program 1 times [2024-10-24 16:21:07,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:07,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42908625] [2024-10-24 16:21:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:07,092 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-24 16:21:07,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:07,094 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-24 16:21:07,101 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-24 16:21:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:07,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:21:07,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:07,283 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-24 16:21:07,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:07,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:07,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42908625] [2024-10-24 16:21:07,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42908625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:07,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:07,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:07,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827960533] [2024-10-24 16:21:07,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:07,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:07,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:07,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:07,285 INFO L87 Difference]: Start difference. First operand 148 states and 231 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:07,443 INFO L93 Difference]: Finished difference Result 193 states and 280 transitions. [2024-10-24 16:21:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:07,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 16:21:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:07,446 INFO L225 Difference]: With dead ends: 193 [2024-10-24 16:21:07,446 INFO L226 Difference]: Without dead ends: 193 [2024-10-24 16:21:07,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:21:07,447 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 79 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:07,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 155 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-24 16:21:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 151. [2024-10-24 16:21:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 138 states have internal predecessors, (208), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-24 16:21:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 234 transitions. [2024-10-24 16:21:07,457 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 234 transitions. Word has length 6 [2024-10-24 16:21:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:07,457 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 234 transitions. [2024-10-24 16:21:07,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 234 transitions. [2024-10-24 16:21:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:21:07,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:07,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:07,465 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:07,662 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-24 16:21:07,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:07,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1700751720, now seen corresponding path program 1 times [2024-10-24 16:21:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:07,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606444776] [2024-10-24 16:21:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:07,666 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-24 16:21:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:07,671 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-24 16:21:07,672 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-24 16:21:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:07,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:21:07,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:07,836 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-24 16:21:07,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:07,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:07,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606444776] [2024-10-24 16:21:07,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606444776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:07,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:07,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024003527] [2024-10-24 16:21:07,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:07,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:07,839 INFO L87 Difference]: Start difference. First operand 151 states and 234 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:07,987 INFO L93 Difference]: Finished difference Result 181 states and 236 transitions. [2024-10-24 16:21:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:07,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 16:21:07,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:07,988 INFO L225 Difference]: With dead ends: 181 [2024-10-24 16:21:07,988 INFO L226 Difference]: Without dead ends: 181 [2024-10-24 16:21:07,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:21:07,989 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 89 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:07,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 184 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-24 16:21:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2024-10-24 16:21:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 119 states have (on average 1.73109243697479) internal successors, (206), 138 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-24 16:21:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 232 transitions. [2024-10-24 16:21:07,998 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 232 transitions. Word has length 7 [2024-10-24 16:21:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:07,998 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 232 transitions. [2024-10-24 16:21:07,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 232 transitions. [2024-10-24 16:21:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 16:21:07,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:07,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:08,004 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-24 16:21:08,199 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-24 16:21:08,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:08,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1183695815, now seen corresponding path program 1 times [2024-10-24 16:21:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:08,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384390918] [2024-10-24 16:21:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:08,201 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-24 16:21:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:08,204 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-24 16:21:08,205 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-24 16:21:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:08,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:21:08,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:08,281 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-24 16:21:08,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:08,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:08,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384390918] [2024-10-24 16:21:08,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384390918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:08,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:08,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:08,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020092951] [2024-10-24 16:21:08,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:08,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:08,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:08,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:08,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:08,283 INFO L87 Difference]: Start difference. First operand 151 states and 232 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:08,388 INFO L93 Difference]: Finished difference Result 233 states and 322 transitions. [2024-10-24 16:21:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:08,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 16:21:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:08,390 INFO L225 Difference]: With dead ends: 233 [2024-10-24 16:21:08,390 INFO L226 Difference]: Without dead ends: 233 [2024-10-24 16:21:08,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:21:08,391 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 130 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:08,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 184 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-24 16:21:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 184. [2024-10-24 16:21:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 1.68) internal successors, (252), 170 states have internal predecessors, (252), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-24 16:21:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 278 transitions. [2024-10-24 16:21:08,400 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 278 transitions. Word has length 8 [2024-10-24 16:21:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:08,400 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 278 transitions. [2024-10-24 16:21:08,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 278 transitions. [2024-10-24 16:21:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:21:08,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:08,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:08,408 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-24 16:21:08,601 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-24 16:21:08,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:08,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:08,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1960135350, now seen corresponding path program 1 times [2024-10-24 16:21:08,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:08,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729553653] [2024-10-24 16:21:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:08,603 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-24 16:21:08,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:08,609 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-24 16:21:08,612 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-24 16:21:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:08,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:21:08,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:08,732 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-24 16:21:08,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:08,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:08,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729553653] [2024-10-24 16:21:08,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729553653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:08,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:08,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724312062] [2024-10-24 16:21:08,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:08,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:08,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:08,736 INFO L87 Difference]: Start difference. First operand 184 states and 278 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:08,866 INFO L93 Difference]: Finished difference Result 234 states and 301 transitions. [2024-10-24 16:21:08,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:08,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 16:21:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:08,868 INFO L225 Difference]: With dead ends: 234 [2024-10-24 16:21:08,868 INFO L226 Difference]: Without dead ends: 234 [2024-10-24 16:21:08,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:21:08,869 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 140 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:08,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 200 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-24 16:21:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 198. [2024-10-24 16:21:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 163 states have (on average 1.6748466257668713) internal successors, (273), 184 states have internal predecessors, (273), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-24 16:21:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 299 transitions. [2024-10-24 16:21:08,879 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 299 transitions. Word has length 9 [2024-10-24 16:21:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:08,879 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 299 transitions. [2024-10-24 16:21:08,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 299 transitions. [2024-10-24 16:21:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:21:08,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:08,880 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:08,889 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:09,087 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-24 16:21:09,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:09,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash -519071088, now seen corresponding path program 1 times [2024-10-24 16:21:09,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:09,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832255960] [2024-10-24 16:21:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:09,088 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-24 16:21:09,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:09,093 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-24 16:21:09,094 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-24 16:21:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:09,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:21:09,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:09,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:09,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:09,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832255960] [2024-10-24 16:21:09,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832255960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:21:09,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:09,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-10-24 16:21:09,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150341660] [2024-10-24 16:21:09,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:09,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:21:09,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:09,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:21:09,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:21:09,472 INFO L87 Difference]: Start difference. First operand 198 states and 299 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:09,778 INFO L93 Difference]: Finished difference Result 269 states and 356 transitions. [2024-10-24 16:21:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:21:09,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 16:21:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:09,780 INFO L225 Difference]: With dead ends: 269 [2024-10-24 16:21:09,780 INFO L226 Difference]: Without dead ends: 269 [2024-10-24 16:21:09,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:21:09,781 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 185 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:09,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 290 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:21:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-24 16:21:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 228. [2024-10-24 16:21:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.6632124352331605) internal successors, (321), 214 states have internal predecessors, (321), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-24 16:21:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 347 transitions. [2024-10-24 16:21:09,795 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 347 transitions. Word has length 13 [2024-10-24 16:21:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:09,795 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 347 transitions. [2024-10-24 16:21:09,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 347 transitions. [2024-10-24 16:21:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:21:09,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:09,795 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:09,799 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-24 16:21:09,996 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-24 16:21:09,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:09,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1088665406, now seen corresponding path program 1 times [2024-10-24 16:21:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069297615] [2024-10-24 16:21:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:09,997 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-24 16:21:09,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:10,000 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-24 16:21:10,003 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-24 16:21:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:10,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:21:10,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:10,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:10,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:10,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069297615] [2024-10-24 16:21:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069297615] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:21:10,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-24 16:21:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893614131] [2024-10-24 16:21:10,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:10,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:21:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:21:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:21:10,394 INFO L87 Difference]: Start difference. First operand 228 states and 347 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:10,712 INFO L93 Difference]: Finished difference Result 287 states and 413 transitions. [2024-10-24 16:21:10,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:21:10,713 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 16:21:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:10,714 INFO L225 Difference]: With dead ends: 287 [2024-10-24 16:21:10,714 INFO L226 Difference]: Without dead ends: 287 [2024-10-24 16:21:10,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:21:10,715 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 107 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:10,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 277 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:21:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-24 16:21:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 238. [2024-10-24 16:21:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.6551724137931034) internal successors, (336), 224 states have internal predecessors, (336), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-24 16:21:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 362 transitions. [2024-10-24 16:21:10,722 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 362 transitions. Word has length 14 [2024-10-24 16:21:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:10,722 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 362 transitions. [2024-10-24 16:21:10,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 362 transitions. [2024-10-24 16:21:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:21:10,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:10,722 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:10,729 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 (9)] Ended with exit code 0 [2024-10-24 16:21:10,929 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-24 16:21:10,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:10,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash -611110737, now seen corresponding path program 1 times [2024-10-24 16:21:10,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:10,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311535209] [2024-10-24 16:21:10,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:10,931 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-24 16:21:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:10,932 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-24 16:21:10,934 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-24 16:21:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:10,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:21:10,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:11,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:11,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:11,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311535209] [2024-10-24 16:21:11,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311535209] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:21:11,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:11,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-24 16:21:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900881875] [2024-10-24 16:21:11,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:11,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:21:11,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:11,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:21:11,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:21:11,341 INFO L87 Difference]: Start difference. First operand 238 states and 362 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:11,983 INFO L93 Difference]: Finished difference Result 394 states and 522 transitions. [2024-10-24 16:21:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:21:11,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 16:21:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:11,986 INFO L225 Difference]: With dead ends: 394 [2024-10-24 16:21:11,986 INFO L226 Difference]: Without dead ends: 394 [2024-10-24 16:21:11,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:21:11,989 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 267 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:11,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 480 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:21:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-24 16:21:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 306. [2024-10-24 16:21:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 268 states have (on average 1.664179104477612) internal successors, (446), 290 states have internal predecessors, (446), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-10-24 16:21:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 478 transitions. [2024-10-24 16:21:12,006 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 478 transitions. Word has length 15 [2024-10-24 16:21:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:12,010 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 478 transitions. [2024-10-24 16:21:12,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 478 transitions. [2024-10-24 16:21:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:21:12,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:12,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:12,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:12,211 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-24 16:21:12,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:12,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -905176023, now seen corresponding path program 1 times [2024-10-24 16:21:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104248594] [2024-10-24 16:21:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:12,212 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-24 16:21:12,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:12,214 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-24 16:21:12,215 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-24 16:21:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:12,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:21:12,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:12,291 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-24 16:21:12,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:12,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:12,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104248594] [2024-10-24 16:21:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104248594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:12,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:12,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:21:12,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417516606] [2024-10-24 16:21:12,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:12,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:21:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:12,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:21:12,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:21:12,293 INFO L87 Difference]: Start difference. First operand 306 states and 478 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:12,319 INFO L93 Difference]: Finished difference Result 447 states and 695 transitions. [2024-10-24 16:21:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:21:12,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 16:21:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:12,321 INFO L225 Difference]: With dead ends: 447 [2024-10-24 16:21:12,322 INFO L226 Difference]: Without dead ends: 447 [2024-10-24 16:21:12,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-24 16:21:12,322 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:12,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 105 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:21:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-24 16:21:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 427. [2024-10-24 16:21:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 380 states have (on average 1.6605263157894736) internal successors, (631), 404 states have internal predecessors, (631), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (43), 13 states have call predecessors, (43), 13 states have call successors, (43) [2024-10-24 16:21:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 687 transitions. [2024-10-24 16:21:12,332 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 687 transitions. Word has length 16 [2024-10-24 16:21:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:12,333 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 687 transitions. [2024-10-24 16:21:12,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 687 transitions. [2024-10-24 16:21:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:21:12,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:12,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:12,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 16:21:12,536 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-24 16:21:12,536 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:12,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash -905175767, now seen corresponding path program 1 times [2024-10-24 16:21:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794528886] [2024-10-24 16:21:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:12,538 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-24 16:21:12,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:12,542 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-24 16:21:12,543 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-24 16:21:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:12,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:21:12,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:12,644 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-24 16:21:12,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:12,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:12,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794528886] [2024-10-24 16:21:12,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794528886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:12,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:12,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:21:12,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685158913] [2024-10-24 16:21:12,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:12,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:21:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:12,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:21:12,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:21:12,646 INFO L87 Difference]: Start difference. First operand 427 states and 687 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:12,684 INFO L93 Difference]: Finished difference Result 474 states and 734 transitions. [2024-10-24 16:21:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:21:12,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 16:21:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:12,686 INFO L225 Difference]: With dead ends: 474 [2024-10-24 16:21:12,687 INFO L226 Difference]: Without dead ends: 474 [2024-10-24 16:21:12,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-24 16:21:12,687 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:12,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:21:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-24 16:21:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 458. [2024-10-24 16:21:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 408 states have (on average 1.642156862745098) internal successors, (670), 433 states have internal predecessors, (670), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-10-24 16:21:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 730 transitions. [2024-10-24 16:21:12,696 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 730 transitions. Word has length 16 [2024-10-24 16:21:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:12,696 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 730 transitions. [2024-10-24 16:21:12,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 730 transitions. [2024-10-24 16:21:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:21:12,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:12,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:12,702 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-24 16:21:12,899 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-24 16:21:12,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:12,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2004314431, now seen corresponding path program 1 times [2024-10-24 16:21:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796540332] [2024-10-24 16:21:12,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:12,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-24 16:21:12,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:12,903 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-24 16:21:12,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 (13)] Waiting until timeout for monitored process [2024-10-24 16:21:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:12,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:21:12,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:13,010 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-24 16:21:13,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:13,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:13,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796540332] [2024-10-24 16:21:13,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796540332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:13,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:13,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:21:13,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476212273] [2024-10-24 16:21:13,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:13,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:21:13,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:13,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:21:13,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:21:13,012 INFO L87 Difference]: Start difference. First operand 458 states and 730 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:13,055 INFO L93 Difference]: Finished difference Result 473 states and 730 transitions. [2024-10-24 16:21:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:21:13,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-24 16:21:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:13,057 INFO L225 Difference]: With dead ends: 473 [2024-10-24 16:21:13,057 INFO L226 Difference]: Without dead ends: 473 [2024-10-24 16:21:13,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-24 16:21:13,057 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:13,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 104 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:21:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-24 16:21:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 458. [2024-10-24 16:21:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 408 states have (on average 1.6323529411764706) internal successors, (666), 433 states have internal predecessors, (666), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-10-24 16:21:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 726 transitions. [2024-10-24 16:21:13,067 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 726 transitions. Word has length 17 [2024-10-24 16:21:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:13,067 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 726 transitions. [2024-10-24 16:21:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 726 transitions. [2024-10-24 16:21:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:21:13,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:13,068 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-24 16:21:13,073 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-24 16:21:13,268 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-24 16:21:13,269 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:13,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:13,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1223463063, now seen corresponding path program 2 times [2024-10-24 16:21:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:13,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468559551] [2024-10-24 16:21:13,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:21:13,270 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-24 16:21:13,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:13,272 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-24 16:21:13,277 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-24 16:21:13,321 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:21:13,321 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:21:13,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:21:13,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:13,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:13,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468559551] [2024-10-24 16:21:13,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468559551] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:21:13,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:13,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-24 16:21:13,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125748190] [2024-10-24 16:21:13,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:13,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:21:13,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:13,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:21:13,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:21:13,880 INFO L87 Difference]: Start difference. First operand 458 states and 726 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:14,507 INFO L93 Difference]: Finished difference Result 536 states and 816 transitions. [2024-10-24 16:21:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:21:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-24 16:21:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:14,510 INFO L225 Difference]: With dead ends: 536 [2024-10-24 16:21:14,510 INFO L226 Difference]: Without dead ends: 536 [2024-10-24 16:21:14,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:21:14,511 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 149 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:14,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 334 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:21:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-24 16:21:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 489. [2024-10-24 16:21:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 439 states have (on average 1.6309794988610478) internal successors, (716), 464 states have internal predecessors, (716), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-10-24 16:21:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 776 transitions. [2024-10-24 16:21:14,521 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 776 transitions. Word has length 21 [2024-10-24 16:21:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:14,521 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 776 transitions. [2024-10-24 16:21:14,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:21:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 776 transitions. [2024-10-24 16:21:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:21:14,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:14,522 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:14,527 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-24 16:21:14,724 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-24 16:21:14,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:14,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1348043702, now seen corresponding path program 1 times [2024-10-24 16:21:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:14,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118443542] [2024-10-24 16:21:14,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:14,726 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-24 16:21:14,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:14,731 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-24 16:21:14,732 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-24 16:21:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:14,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 16:21:14,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:14,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:14,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118443542] [2024-10-24 16:21:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118443542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:14,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:14,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:14,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710966081] [2024-10-24 16:21:14,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:14,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:21:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:21:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:21:14,791 INFO L87 Difference]: Start difference. First operand 489 states and 776 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:14,805 INFO L93 Difference]: Finished difference Result 342 states and 518 transitions. [2024-10-24 16:21:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:21:14,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 16:21:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:14,807 INFO L225 Difference]: With dead ends: 342 [2024-10-24 16:21:14,807 INFO L226 Difference]: Without dead ends: 342 [2024-10-24 16:21:14,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:21:14,808 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:14,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:21:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-24 16:21:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2024-10-24 16:21:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 300 states have (on average 1.6033333333333333) internal successors, (481), 323 states have internal predecessors, (481), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-24 16:21:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 517 transitions. [2024-10-24 16:21:14,815 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 517 transitions. Word has length 23 [2024-10-24 16:21:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:14,815 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 517 transitions. [2024-10-24 16:21:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 517 transitions. [2024-10-24 16:21:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:21:14,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:14,816 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:14,821 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-24 16:21:15,018 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-24 16:21:15,019 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:15,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1173620402, now seen corresponding path program 1 times [2024-10-24 16:21:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764783876] [2024-10-24 16:21:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:15,020 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-24 16:21:15,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:15,022 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-24 16:21:15,023 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-24 16:21:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:15,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 16:21:15,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:15,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:15,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:15,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:15,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764783876] [2024-10-24 16:21:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764783876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:21:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [379713449] [2024-10-24 16:21:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:21:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:21:15,569 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:21:15,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-10-24 16:21:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:15,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 16:21:15,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:15,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:15,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:15,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:16,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [379713449] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:21:16,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:16,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-24 16:21:16,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476389829] [2024-10-24 16:21:16,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:16,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:21:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:21:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:21:16,072 INFO L87 Difference]: Start difference. First operand 341 states and 517 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:16,576 INFO L93 Difference]: Finished difference Result 367 states and 513 transitions. [2024-10-24 16:21:16,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:21:16,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-24 16:21:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:16,580 INFO L225 Difference]: With dead ends: 367 [2024-10-24 16:21:16,580 INFO L226 Difference]: Without dead ends: 367 [2024-10-24 16:21:16,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:21:16,580 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 198 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:16,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 119 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:21:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-24 16:21:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 355. [2024-10-24 16:21:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 311 states have (on average 1.4887459807073955) internal successors, (463), 335 states have internal predecessors, (463), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-24 16:21:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 506 transitions. [2024-10-24 16:21:16,590 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 506 transitions. Word has length 25 [2024-10-24 16:21:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:16,590 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 506 transitions. [2024-10-24 16:21:16,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 506 transitions. [2024-10-24 16:21:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:21:16,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:16,592 INFO L215 NwaCegarLoop]: trace histogram [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-24 16:21:16,598 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-24 16:21:16,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-10-24 16:21:16,993 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 16:21:16,994 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -177446873, now seen corresponding path program 1 times [2024-10-24 16:21:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867212342] [2024-10-24 16:21:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:16,995 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-24 16:21:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:16,997 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-24 16:21:17,000 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-24 16:21:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:17,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:21:17,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:17,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:17,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867212342] [2024-10-24 16:21:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867212342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:17,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:17,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:21:17,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058585784] [2024-10-24 16:21:17,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:17,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:17,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:17,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:17,186 INFO L87 Difference]: Start difference. First operand 355 states and 506 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:17,249 INFO L93 Difference]: Finished difference Result 369 states and 516 transitions. [2024-10-24 16:21:17,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:17,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-24 16:21:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:17,251 INFO L225 Difference]: With dead ends: 369 [2024-10-24 16:21:17,251 INFO L226 Difference]: Without dead ends: 369 [2024-10-24 16:21:17,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:17,251 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:17,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 139 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-24 16:21:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2024-10-24 16:21:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 317 states have (on average 1.4794952681388012) internal successors, (469), 341 states have internal predecessors, (469), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-24 16:21:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 512 transitions. [2024-10-24 16:21:17,258 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 512 transitions. Word has length 26 [2024-10-24 16:21:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:17,258 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 512 transitions. [2024-10-24 16:21:17,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 512 transitions. [2024-10-24 16:21:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:21:17,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:17,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:17,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-24 16:21:17,459 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-24 16:21:17,460 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:17,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:17,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1727191021, now seen corresponding path program 1 times [2024-10-24 16:21:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:17,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792347048] [2024-10-24 16:21:17,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:17,461 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-24 16:21:17,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:17,466 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-24 16:21:17,474 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-24 16:21:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:17,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:21:17,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:17,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:17,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:17,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:22,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792347048] [2024-10-24 16:21:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792347048] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:21:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [525250259] [2024-10-24 16:21:22,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:22,119 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:21:22,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:21:22,123 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:21:22,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-10-24 16:21:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:22,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 16:21:22,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:22,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:22,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:22,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:26,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [525250259] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:21:26,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:26,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2024-10-24 16:21:26,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854142926] [2024-10-24 16:21:26,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:26,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:21:26,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:26,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:21:26,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2024-10-24 16:21:26,791 INFO L87 Difference]: Start difference. First operand 361 states and 512 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:27,409 INFO L93 Difference]: Finished difference Result 370 states and 512 transitions. [2024-10-24 16:21:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:21:27,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-24 16:21:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:27,415 INFO L225 Difference]: With dead ends: 370 [2024-10-24 16:21:27,415 INFO L226 Difference]: Without dead ends: 370 [2024-10-24 16:21:27,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=143, Invalid=362, Unknown=1, NotChecked=0, Total=506 [2024-10-24 16:21:27,415 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 206 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:27,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 179 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:21:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-24 16:21:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2024-10-24 16:21:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 318 states have (on average 1.4622641509433962) internal successors, (465), 342 states have internal predecessors, (465), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-24 16:21:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 508 transitions. [2024-10-24 16:21:27,422 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 508 transitions. Word has length 27 [2024-10-24 16:21:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:27,422 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 508 transitions. [2024-10-24 16:21:27,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 508 transitions. [2024-10-24 16:21:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:21:27,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:27,423 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:27,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:27,627 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 (19)] Ended with exit code 0 [2024-10-24 16:21:27,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-24 16:21:27,824 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:27,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2003314146, now seen corresponding path program 1 times [2024-10-24 16:21:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724347926] [2024-10-24 16:21:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:27,825 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-24 16:21:27,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:27,826 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-24 16:21:27,828 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-24 16:21:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:27,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:21:27,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:27,944 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (_ bv1 1)))) is different from true [2024-10-24 16:21:27,986 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 16:21:27,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-24 16:21:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:28,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:28,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:28,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724347926] [2024-10-24 16:21:28,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724347926] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:21:28,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:28,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2024-10-24 16:21:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104644478] [2024-10-24 16:21:28,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:28,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:21:28,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:21:28,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2024-10-24 16:21:28,257 INFO L87 Difference]: Start difference. First operand 362 states and 508 transitions. Second operand has 10 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:21:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:28,672 INFO L93 Difference]: Finished difference Result 513 states and 661 transitions. [2024-10-24 16:21:28,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:21:28,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-24 16:21:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:28,674 INFO L225 Difference]: With dead ends: 513 [2024-10-24 16:21:28,675 INFO L226 Difference]: Without dead ends: 513 [2024-10-24 16:21:28,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=252, Unknown=8, NotChecked=36, Total=420 [2024-10-24 16:21:28,675 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 293 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:28,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 264 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 196 Invalid, 0 Unknown, 180 Unchecked, 0.3s Time] [2024-10-24 16:21:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-10-24 16:21:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 443. [2024-10-24 16:21:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 396 states have (on average 1.4141414141414141) internal successors, (560), 421 states have internal predecessors, (560), 11 states have call successors, (11), 10 states have call predecessors, (11), 18 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-24 16:21:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 602 transitions. [2024-10-24 16:21:28,683 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 602 transitions. Word has length 28 [2024-10-24 16:21:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:28,683 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 602 transitions. [2024-10-24 16:21:28,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:21:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 602 transitions. [2024-10-24 16:21:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:21:28,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:28,684 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:28,690 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-24 16:21:28,887 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-24 16:21:28,887 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1973196431, now seen corresponding path program 1 times [2024-10-24 16:21:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153194400] [2024-10-24 16:21:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:28,889 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-24 16:21:28,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:28,890 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:28,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-24 16:21:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:28,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:21:28,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:29,069 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|)))) is different from true [2024-10-24 16:21:29,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:29,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:29,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:29,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153194400] [2024-10-24 16:21:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153194400] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:21:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2083226953] [2024-10-24 16:21:29,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:29,386 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:21:29,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:21:29,387 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:21:29,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-10-24 16:21:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:29,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:21:29,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:29,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:29,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:29,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2083226953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:21:29,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-24 16:21:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649820850] [2024-10-24 16:21:29,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:29,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:21:29,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:29,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:21:29,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2024-10-24 16:21:29,838 INFO L87 Difference]: Start difference. First operand 443 states and 602 transitions. Second operand has 8 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:30,376 INFO L93 Difference]: Finished difference Result 607 states and 755 transitions. [2024-10-24 16:21:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:21:30,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-24 16:21:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:30,378 INFO L225 Difference]: With dead ends: 607 [2024-10-24 16:21:30,379 INFO L226 Difference]: Without dead ends: 607 [2024-10-24 16:21:30,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=291, Unknown=1, NotChecked=38, Total=462 [2024-10-24 16:21:30,379 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 375 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:30,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 202 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 159 Invalid, 0 Unknown, 228 Unchecked, 0.3s Time] [2024-10-24 16:21:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-24 16:21:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 534. [2024-10-24 16:21:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 484 states have (on average 1.3884297520661157) internal successors, (672), 511 states have internal predecessors, (672), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-24 16:21:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 710 transitions. [2024-10-24 16:21:30,387 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 710 transitions. Word has length 29 [2024-10-24 16:21:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:30,387 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 710 transitions. [2024-10-24 16:21:30,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 710 transitions. [2024-10-24 16:21:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:21:30,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:30,388 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:30,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:30,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:30,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:30,789 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:30,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1854582443, now seen corresponding path program 1 times [2024-10-24 16:21:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:30,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754161917] [2024-10-24 16:21:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:30,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:30,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:30,791 INFO L229 MonitoredProcess]: Starting monitored process 24 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-24 16:21:30,793 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 (24)] Waiting until timeout for monitored process [2024-10-24 16:21:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:30,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:21:30,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:31,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:31,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:31,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:31,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754161917] [2024-10-24 16:21:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754161917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:21:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1418408312] [2024-10-24 16:21:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:31,906 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:21:31,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:21:31,907 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:21:31,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-10-24 16:21:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:32,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:21:32,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:32,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:32,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:32,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1418408312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:21:32,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-24 16:21:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999179855] [2024-10-24 16:21:32,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:32,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:21:32,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:32,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:21:32,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:21:32,708 INFO L87 Difference]: Start difference. First operand 534 states and 710 transitions. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:33,787 INFO L93 Difference]: Finished difference Result 559 states and 717 transitions. [2024-10-24 16:21:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:21:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-10-24 16:21:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:33,790 INFO L225 Difference]: With dead ends: 559 [2024-10-24 16:21:33,790 INFO L226 Difference]: Without dead ends: 559 [2024-10-24 16:21:33,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:21:33,795 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 210 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:33,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 157 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 16:21:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-24 16:21:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 539. [2024-10-24 16:21:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 489 states have (on average 1.359918200408998) internal successors, (665), 516 states have internal predecessors, (665), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-24 16:21:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 703 transitions. [2024-10-24 16:21:33,807 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 703 transitions. Word has length 33 [2024-10-24 16:21:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:33,807 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 703 transitions. [2024-10-24 16:21:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 703 transitions. [2024-10-24 16:21:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:21:33,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:33,807 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:33,814 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 (24)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:34,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:34,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 16:21:34,208 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:34,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2145365376, now seen corresponding path program 1 times [2024-10-24 16:21:34,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:34,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781385702] [2024-10-24 16:21:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:34,209 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-24 16:21:34,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:34,212 INFO L229 MonitoredProcess]: Starting monitored process 26 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-24 16:21:34,213 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 (26)] Waiting until timeout for monitored process [2024-10-24 16:21:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:34,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:21:34,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:34,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:35,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781385702] [2024-10-24 16:21:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781385702] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:21:35,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:35,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-24 16:21:35,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402909177] [2024-10-24 16:21:35,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:35,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 16:21:35,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:35,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 16:21:35,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:21:35,236 INFO L87 Difference]: Start difference. First operand 539 states and 703 transitions. Second operand has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:21:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:35,762 INFO L93 Difference]: Finished difference Result 464 states and 595 transitions. [2024-10-24 16:21:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:21:35,763 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-10-24 16:21:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:35,765 INFO L225 Difference]: With dead ends: 464 [2024-10-24 16:21:35,765 INFO L226 Difference]: Without dead ends: 464 [2024-10-24 16:21:35,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:21:35,765 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 254 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:35,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 443 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:21:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-10-24 16:21:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 355. [2024-10-24 16:21:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 317 states have (on average 1.3817034700315458) internal successors, (438), 340 states have internal predecessors, (438), 7 states have call successors, (7), 7 states have call predecessors, (7), 13 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2024-10-24 16:21:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 460 transitions. [2024-10-24 16:21:35,771 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 460 transitions. Word has length 34 [2024-10-24 16:21:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:35,771 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 460 transitions. [2024-10-24 16:21:35,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:21:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 460 transitions. [2024-10-24 16:21:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 16:21:35,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:35,772 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:35,777 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 (26)] Ended with exit code 0 [2024-10-24 16:21:35,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-24 16:21:35,972 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:35,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash -120547086, now seen corresponding path program 1 times [2024-10-24 16:21:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777462225] [2024-10-24 16:21:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:35,973 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-24 16:21:35,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:35,976 INFO L229 MonitoredProcess]: Starting monitored process 27 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-24 16:21:35,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-24 16:21:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:36,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:21:36,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:21:36,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:21:36,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:36,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777462225] [2024-10-24 16:21:36,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777462225] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:21:36,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:36,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 16:21:36,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619982327] [2024-10-24 16:21:36,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:36,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:21:36,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:36,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:21:36,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:21:36,159 INFO L87 Difference]: Start difference. First operand 355 states and 460 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:36,247 INFO L93 Difference]: Finished difference Result 306 states and 373 transitions. [2024-10-24 16:21:36,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:36,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2024-10-24 16:21:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:36,250 INFO L225 Difference]: With dead ends: 306 [2024-10-24 16:21:36,250 INFO L226 Difference]: Without dead ends: 306 [2024-10-24 16:21:36,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 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-24 16:21:36,251 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 37 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:36,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 234 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-24 16:21:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2024-10-24 16:21:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 269 states have (on average 1.304832713754647) internal successors, (351), 289 states have internal predecessors, (351), 7 states have call successors, (7), 7 states have call predecessors, (7), 13 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2024-10-24 16:21:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 373 transitions. [2024-10-24 16:21:36,256 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 373 transitions. Word has length 42 [2024-10-24 16:21:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:36,257 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 373 transitions. [2024-10-24 16:21:36,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 373 transitions. [2024-10-24 16:21:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 16:21:36,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:36,258 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:36,265 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 (27)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:36,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-24 16:21:36,458 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:36,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash 977756381, now seen corresponding path program 1 times [2024-10-24 16:21:36,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:36,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058026965] [2024-10-24 16:21:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:36,460 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-24 16:21:36,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:36,461 INFO L229 MonitoredProcess]: Starting monitored process 28 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-24 16:21:36,463 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 (28)] Waiting until timeout for monitored process [2024-10-24 16:21:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:36,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:21:36,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:21:36,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:36,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058026965] [2024-10-24 16:21:36,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058026965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:36,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:36,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:36,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651302947] [2024-10-24 16:21:36,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:36,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:21:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:36,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:21:36,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:21:36,668 INFO L87 Difference]: Start difference. First operand 304 states and 373 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:36,714 INFO L93 Difference]: Finished difference Result 302 states and 367 transitions. [2024-10-24 16:21:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:21:36,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-24 16:21:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:36,716 INFO L225 Difference]: With dead ends: 302 [2024-10-24 16:21:36,716 INFO L226 Difference]: Without dead ends: 302 [2024-10-24 16:21:36,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:36,717 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:36,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 94 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:21:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-24 16:21:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2024-10-24 16:21:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 263 states have (on average 1.273764258555133) internal successors, (335), 281 states have internal predecessors, (335), 7 states have call successors, (7), 7 states have call predecessors, (7), 13 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2024-10-24 16:21:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 357 transitions. [2024-10-24 16:21:36,725 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 357 transitions. Word has length 44 [2024-10-24 16:21:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:36,725 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 357 transitions. [2024-10-24 16:21:36,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 357 transitions. [2024-10-24 16:21:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 16:21:36,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:36,726 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:36,734 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 (28)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:36,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-24 16:21:36,928 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:36,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 977756637, now seen corresponding path program 1 times [2024-10-24 16:21:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:36,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826412314] [2024-10-24 16:21:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:36,928 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-24 16:21:36,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:36,931 INFO L229 MonitoredProcess]: Starting monitored process 29 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-24 16:21:36,935 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 (29)] Waiting until timeout for monitored process [2024-10-24 16:21:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:36,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:21:36,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 16:21:37,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:37,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:37,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826412314] [2024-10-24 16:21:37,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826412314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:37,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:37,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:37,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610175783] [2024-10-24 16:21:37,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:37,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:21:37,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:37,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:21:37,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:21:37,012 INFO L87 Difference]: Start difference. First operand 296 states and 357 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:37,030 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2024-10-24 16:21:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:21:37,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-24 16:21:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:37,031 INFO L225 Difference]: With dead ends: 273 [2024-10-24 16:21:37,031 INFO L226 Difference]: Without dead ends: 273 [2024-10-24 16:21:37,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-24 16:21:37,032 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:37,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:21:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-24 16:21:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-10-24 16:21:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 245 states have (on average 1.220408163265306) internal successors, (299), 258 states have internal predecessors, (299), 7 states have call successors, (7), 7 states have call predecessors, (7), 13 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2024-10-24 16:21:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 321 transitions. [2024-10-24 16:21:37,036 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 321 transitions. Word has length 44 [2024-10-24 16:21:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:37,037 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 321 transitions. [2024-10-24 16:21:37,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 321 transitions. [2024-10-24 16:21:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 16:21:37,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:37,037 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:37,042 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 (29)] Ended with exit code 0 [2024-10-24 16:21:37,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-24 16:21:37,242 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:37,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 245676811, now seen corresponding path program 1 times [2024-10-24 16:21:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987916419] [2024-10-24 16:21:37,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:37,243 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-24 16:21:37,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:37,244 INFO L229 MonitoredProcess]: Starting monitored process 30 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-24 16:21:37,245 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 (30)] Waiting until timeout for monitored process [2024-10-24 16:21:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:37,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:21:37,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:21:37,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:37,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987916419] [2024-10-24 16:21:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987916419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:37,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:37,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647997927] [2024-10-24 16:21:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:37,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:37,601 INFO L87 Difference]: Start difference. First operand 273 states and 321 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:37,705 INFO L93 Difference]: Finished difference Result 279 states and 319 transitions. [2024-10-24 16:21:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:21:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-24 16:21:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:37,706 INFO L225 Difference]: With dead ends: 279 [2024-10-24 16:21:37,706 INFO L226 Difference]: Without dead ends: 279 [2024-10-24 16:21:37,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:21:37,708 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:37,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 112 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-24 16:21:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2024-10-24 16:21:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 245 states have (on average 1.1959183673469387) internal successors, (293), 257 states have internal predecessors, (293), 7 states have call successors, (7), 7 states have call predecessors, (7), 13 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2024-10-24 16:21:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 315 transitions. [2024-10-24 16:21:37,719 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 315 transitions. Word has length 45 [2024-10-24 16:21:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:37,719 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 315 transitions. [2024-10-24 16:21:37,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 315 transitions. [2024-10-24 16:21:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 16:21:37,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:37,719 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:37,726 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 (30)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:37,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-24 16:21:37,920 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:37,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash -973953377, now seen corresponding path program 1 times [2024-10-24 16:21:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:37,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272018867] [2024-10-24 16:21:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:37,922 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-24 16:21:37,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:37,923 INFO L229 MonitoredProcess]: Starting monitored process 31 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-24 16:21:37,924 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 (31)] Waiting until timeout for monitored process [2024-10-24 16:21:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:37,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:21:37,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:37,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:21:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 16:21:38,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:38,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:38,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272018867] [2024-10-24 16:21:38,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272018867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:38,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:38,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:38,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188190556] [2024-10-24 16:21:38,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:38,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:21:38,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:38,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:21:38,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:21:38,105 INFO L87 Difference]: Start difference. First operand 272 states and 315 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:38,239 INFO L93 Difference]: Finished difference Result 287 states and 325 transitions. [2024-10-24 16:21:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:38,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-24 16:21:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:38,240 INFO L225 Difference]: With dead ends: 287 [2024-10-24 16:21:38,240 INFO L226 Difference]: Without dead ends: 287 [2024-10-24 16:21:38,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:38,241 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:38,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-24 16:21:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 276. [2024-10-24 16:21:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 249 states have (on average 1.1847389558232932) internal successors, (295), 261 states have internal predecessors, (295), 7 states have call successors, (7), 7 states have call predecessors, (7), 13 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2024-10-24 16:21:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 317 transitions. [2024-10-24 16:21:38,250 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 317 transitions. Word has length 46 [2024-10-24 16:21:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:38,250 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 317 transitions. [2024-10-24 16:21:38,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 317 transitions. [2024-10-24 16:21:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 16:21:38,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:38,251 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:38,258 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 (31)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:38,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-24 16:21:38,451 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-24 16:21:38,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash -169332805, now seen corresponding path program 1 times [2024-10-24 16:21:38,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:38,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568149560] [2024-10-24 16:21:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:38,453 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-24 16:21:38,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:38,455 INFO L229 MonitoredProcess]: Starting monitored process 32 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-24 16:21:38,455 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 (32)] Waiting until timeout for monitored process [2024-10-24 16:21:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:38,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 16:21:38,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:38,594 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (select |c_#valid| |parse_input_c1_~x~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|)))) is different from true [2024-10-24 16:21:38,661 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-24 16:21:38,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-24 16:21:38,702 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (_ bv1 1)))) is different from true [2024-10-24 16:21:38,730 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 16:21:38,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-24 16:21:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 7 not checked. [2024-10-24 16:21:38,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:21:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 16:21:39,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:39,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568149560] [2024-10-24 16:21:39,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568149560] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:21:39,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:21:39,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2024-10-24 16:21:39,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467027771] [2024-10-24 16:21:39,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:21:39,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:21:39,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:39,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:21:39,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=51, Unknown=2, NotChecked=30, Total=110 [2024-10-24 16:21:39,062 INFO L87 Difference]: Start difference. First operand 276 states and 317 transitions. Second operand has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)