./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.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 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:45:39,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:45:39,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:45:39,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:45:39,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:45:39,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:45:39,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:45:39,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:45:39,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:45:39,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:45:39,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:45:39,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:45:39,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:45:39,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:45:39,543 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:45:39,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:45:39,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:45:39,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:45:39,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:45:39,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:45:39,545 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:45:39,545 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:45:39,545 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:45:39,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:45:39,546 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:45:39,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:45:39,546 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:45:39,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:45:39,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:45:39,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:45:39,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:45:39,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:45:39,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:45:39,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:45:39,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:45:39,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:45:39,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:45:39,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:45:39,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:45:39,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:45:39,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:45:39,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:45:39,553 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 -> 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c [2024-11-19 06:45:39,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:45:39,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:45:39,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:45:39,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:45:39,837 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:45:39,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-11-19 06:45:41,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:45:41,551 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:45:41,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-11-19 06:45:41,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df15cd386/f806f2dfbf724058894d9237ff3d5e39/FLAGc04efe8fe [2024-11-19 06:45:41,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df15cd386/f806f2dfbf724058894d9237ff3d5e39 [2024-11-19 06:45:41,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:45:41,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:45:41,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:45:41,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:45:41,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:45:41,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:45:41" (1/1) ... [2024-11-19 06:45:41,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcccbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:41, skipping insertion in model container [2024-11-19 06:45:41,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:45:41" (1/1) ... [2024-11-19 06:45:41,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:45:42,065 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:45:42,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:45:42,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:45:42,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:45:42,169 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:45:42,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42 WrapperNode [2024-11-19 06:45:42,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:45:42,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:45:42,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:45:42,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:45:42,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,214 INFO L138 Inliner]: procedures = 168, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 99 [2024-11-19 06:45:42,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:45:42,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:45:42,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:45:42,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:45:42,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,245 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 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-11-19 06:45:42,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:45:42,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:45:42,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:45:42,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:45:42,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (1/1) ... [2024-11-19 06:45:42,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:45:42,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:42,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:45:42,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:45:42,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:45:42,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:45:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 06:45:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-19 06:45:42,362 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-19 06:45:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:45:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:45:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:45:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:45:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:45:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:45:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:45:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:45:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:45:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:45:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:45:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:45:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:45:42,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:45:42,472 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:45:42,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:45:42,731 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-19 06:45:42,732 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:45:42,747 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:45:42,750 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 06:45:42,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:45:42 BoogieIcfgContainer [2024-11-19 06:45:42,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:45:42,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:45:42,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:45:42,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:45:42,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:45:41" (1/3) ... [2024-11-19 06:45:42,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32000b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:45:42, skipping insertion in model container [2024-11-19 06:45:42,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:42" (2/3) ... [2024-11-19 06:45:42,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32000b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:45:42, skipping insertion in model container [2024-11-19 06:45:42,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:45:42" (3/3) ... [2024-11-19 06:45:42,759 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2024-11-19 06:45:42,772 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:45:42,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-19 06:45:42,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:45:42,820 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;@5417460b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:45:42,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-19 06:45:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 40 states have (on average 1.775) internal successors, (71), 63 states have internal predecessors, (71), 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-11-19 06:45:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:45:42,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:42,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:45:42,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:42,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash -565372166, now seen corresponding path program 1 times [2024-11-19 06:45:42,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:42,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488240329] [2024-11-19 06:45:42,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:43,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488240329] [2024-11-19 06:45:43,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488240329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:43,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:43,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:45:43,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437302489] [2024-11-19 06:45:43,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:43,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:45:43,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:45:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:45:43,266 INFO L87 Difference]: Start difference. First operand has 68 states, 40 states have (on average 1.775) internal successors, (71), 63 states have internal predecessors, (71), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-19 06:45:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:43,509 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2024-11-19 06:45:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:45:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-19 06:45:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:43,525 INFO L225 Difference]: With dead ends: 137 [2024-11-19 06:45:43,525 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 06:45:43,527 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-11-19 06:45:43,530 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 163 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:43,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 117 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 06:45:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 98. [2024-11-19 06:45:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 88 states have internal predecessors, (110), 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-11-19 06:45:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2024-11-19 06:45:43,571 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 6 [2024-11-19 06:45:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:43,571 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2024-11-19 06:45:43,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-19 06:45:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2024-11-19 06:45:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:45:43,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:43,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:45:43,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:45:43,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:43,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash -565372165, now seen corresponding path program 1 times [2024-11-19 06:45:43,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:43,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898335512] [2024-11-19 06:45:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898335512] [2024-11-19 06:45:43,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898335512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:43,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:43,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460638826] [2024-11-19 06:45:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:43,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:43,755 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 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-11-19 06:45:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:43,903 INFO L93 Difference]: Finished difference Result 200 states and 272 transitions. [2024-11-19 06:45:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:45:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 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-11-19 06:45:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:43,906 INFO L225 Difference]: With dead ends: 200 [2024-11-19 06:45:43,906 INFO L226 Difference]: Without dead ends: 200 [2024-11-19 06:45:43,906 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-11-19 06:45:43,907 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 89 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:43,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 226 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-19 06:45:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 174. [2024-11-19 06:45:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 136 states have (on average 1.6397058823529411) internal successors, (223), 156 states have internal predecessors, (223), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 268 transitions. [2024-11-19 06:45:43,928 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 268 transitions. Word has length 6 [2024-11-19 06:45:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:43,929 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 268 transitions. [2024-11-19 06:45:43,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 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-11-19 06:45:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 268 transitions. [2024-11-19 06:45:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:45:43,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:43,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:43,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:45:43,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:43,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash -346667981, now seen corresponding path program 1 times [2024-11-19 06:45:43,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:43,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009969505] [2024-11-19 06:45:43,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:43,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:44,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:44,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009969505] [2024-11-19 06:45:44,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009969505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:44,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:44,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:44,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274663615] [2024-11-19 06:45:44,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:44,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:44,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:44,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:44,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:44,131 INFO L87 Difference]: Start difference. First operand 174 states and 268 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-11-19 06:45:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:44,300 INFO L93 Difference]: Finished difference Result 225 states and 323 transitions. [2024-11-19 06:45:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:44,301 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-11-19 06:45:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:44,303 INFO L225 Difference]: With dead ends: 225 [2024-11-19 06:45:44,304 INFO L226 Difference]: Without dead ends: 225 [2024-11-19 06:45:44,304 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-11-19 06:45:44,305 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 72 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:44,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 184 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-19 06:45:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 177. [2024-11-19 06:45:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 139 states have (on average 1.6258992805755397) internal successors, (226), 159 states have internal predecessors, (226), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 271 transitions. [2024-11-19 06:45:44,337 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 271 transitions. Word has length 7 [2024-11-19 06:45:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:44,338 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 271 transitions. [2024-11-19 06:45:44,338 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-11-19 06:45:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 271 transitions. [2024-11-19 06:45:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:45:44,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:44,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:44,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:45:44,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:44,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2138194522, now seen corresponding path program 1 times [2024-11-19 06:45:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888851837] [2024-11-19 06:45:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:44,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:44,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888851837] [2024-11-19 06:45:44,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888851837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:44,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:44,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381008743] [2024-11-19 06:45:44,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:44,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:44,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:44,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:44,582 INFO L87 Difference]: Start difference. First operand 177 states and 271 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-19 06:45:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:44,700 INFO L93 Difference]: Finished difference Result 202 states and 273 transitions. [2024-11-19 06:45:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:44,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-19 06:45:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:44,702 INFO L225 Difference]: With dead ends: 202 [2024-11-19 06:45:44,703 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 06:45:44,703 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-11-19 06:45:44,704 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:44,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 220 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 06:45:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 177. [2024-11-19 06:45:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 139 states have (on average 1.6115107913669064) internal successors, (224), 159 states have internal predecessors, (224), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2024-11-19 06:45:44,723 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 8 [2024-11-19 06:45:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:44,723 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2024-11-19 06:45:44,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-19 06:45:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2024-11-19 06:45:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:45:44,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:44,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:44,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:45:44,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:44,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1859520789, now seen corresponding path program 1 times [2024-11-19 06:45:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081677122] [2024-11-19 06:45:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081677122] [2024-11-19 06:45:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081677122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022760051] [2024-11-19 06:45:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:44,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:44,809 INFO L87 Difference]: Start difference. First operand 177 states and 269 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-11-19 06:45:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:44,925 INFO L93 Difference]: Finished difference Result 272 states and 372 transitions. [2024-11-19 06:45:44,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:44,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-11-19 06:45:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:44,928 INFO L225 Difference]: With dead ends: 272 [2024-11-19 06:45:44,928 INFO L226 Difference]: Without dead ends: 272 [2024-11-19 06:45:44,928 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-11-19 06:45:44,929 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 149 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:44,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 197 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-19 06:45:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 211. [2024-11-19 06:45:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 171 states have (on average 1.5847953216374269) internal successors, (271), 192 states have internal predecessors, (271), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2024-11-19 06:45:44,951 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 316 transitions. Word has length 9 [2024-11-19 06:45:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:44,952 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 316 transitions. [2024-11-19 06:45:44,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-11-19 06:45:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 316 transitions. [2024-11-19 06:45:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:45:44,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:44,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:44,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:45:44,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:44,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1810569660, now seen corresponding path program 1 times [2024-11-19 06:45:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:44,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37376900] [2024-11-19 06:45:44,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:45,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:45,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37376900] [2024-11-19 06:45:45,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37376900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:45,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:45,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:45,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487117429] [2024-11-19 06:45:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:45,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:45,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:45,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:45,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:45,047 INFO L87 Difference]: Start difference. First operand 211 states and 316 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-11-19 06:45:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:45,131 INFO L93 Difference]: Finished difference Result 259 states and 339 transitions. [2024-11-19 06:45:45,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:45,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-11-19 06:45:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:45,133 INFO L225 Difference]: With dead ends: 259 [2024-11-19 06:45:45,133 INFO L226 Difference]: Without dead ends: 259 [2024-11-19 06:45:45,133 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-11-19 06:45:45,134 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 187 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:45,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 219 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-19 06:45:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 225. [2024-11-19 06:45:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 184 states have (on average 1.5869565217391304) internal successors, (292), 206 states have internal predecessors, (292), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 337 transitions. [2024-11-19 06:45:45,145 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 337 transitions. Word has length 10 [2024-11-19 06:45:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:45,145 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 337 transitions. [2024-11-19 06:45:45,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-11-19 06:45:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 337 transitions. [2024-11-19 06:45:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:45:45,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:45,146 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:45,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:45:45,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:45,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash -381204798, now seen corresponding path program 1 times [2024-11-19 06:45:45,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:45,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209171515] [2024-11-19 06:45:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:45,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:45,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209171515] [2024-11-19 06:45:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209171515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256529768] [2024-11-19 06:45:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:45,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:45,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:45,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:45,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:45:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:45,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:45:45,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:45,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:45,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256529768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:45,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-11-19 06:45:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265703304] [2024-11-19 06:45:45,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:45,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:45:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:45:45,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:45:45,709 INFO L87 Difference]: Start difference. First operand 225 states and 337 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-11-19 06:45:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:45,913 INFO L93 Difference]: Finished difference Result 251 states and 336 transitions. [2024-11-19 06:45:45,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:45:45,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-11-19 06:45:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:45,916 INFO L225 Difference]: With dead ends: 251 [2024-11-19 06:45:45,916 INFO L226 Difference]: Without dead ends: 251 [2024-11-19 06:45:45,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 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-11-19 06:45:45,920 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 191 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:45,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 444 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-19 06:45:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 228. [2024-11-19 06:45:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 187 states have (on average 1.5294117647058822) internal successors, (286), 209 states have internal predecessors, (286), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 331 transitions. [2024-11-19 06:45:45,928 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 331 transitions. Word has length 14 [2024-11-19 06:45:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:45,929 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 331 transitions. [2024-11-19 06:45:45,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-11-19 06:45:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 331 transitions. [2024-11-19 06:45:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:45:45,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:45,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:45,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:45:46,130 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-11-19 06:45:46,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:46,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1067553100, now seen corresponding path program 1 times [2024-11-19 06:45:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:46,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958254116] [2024-11-19 06:45:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:46,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958254116] [2024-11-19 06:45:46,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958254116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727514956] [2024-11-19 06:45:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:46,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:46,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:46,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:46,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:45:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:46,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:45:46,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:46,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727514956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:46,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:46,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2024-11-19 06:45:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138225458] [2024-11-19 06:45:46,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:46,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:45:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:46,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:45:46,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:45:46,638 INFO L87 Difference]: Start difference. First operand 228 states and 331 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-11-19 06:45:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:46,970 INFO L93 Difference]: Finished difference Result 277 states and 382 transitions. [2024-11-19 06:45:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:45:46,971 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-11-19 06:45:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:46,973 INFO L225 Difference]: With dead ends: 277 [2024-11-19 06:45:46,973 INFO L226 Difference]: Without dead ends: 277 [2024-11-19 06:45:46,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:45:46,974 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 106 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:46,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 455 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:45:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-19 06:45:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 236. [2024-11-19 06:45:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 195 states have (on average 1.523076923076923) internal successors, (297), 217 states have internal predecessors, (297), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 342 transitions. [2024-11-19 06:45:46,991 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 342 transitions. Word has length 15 [2024-11-19 06:45:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:46,991 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 342 transitions. [2024-11-19 06:45:46,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-11-19 06:45:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 342 transitions. [2024-11-19 06:45:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:45:46,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:46,992 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:47,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:45:47,197 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-11-19 06:45:47,198 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:47,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1265592223, now seen corresponding path program 1 times [2024-11-19 06:45:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566489822] [2024-11-19 06:45:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:47,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566489822] [2024-11-19 06:45:47,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566489822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:47,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657694230] [2024-11-19 06:45:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:47,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:47,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:47,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:47,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:45:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:47,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:45:47,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:47,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-11-19 06:45:47,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:47,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657694230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:47,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:47,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-19 06:45:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400920605] [2024-11-19 06:45:47,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:47,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:45:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:45:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:45:47,829 INFO L87 Difference]: Start difference. First operand 236 states and 342 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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-11-19 06:45:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:48,336 INFO L93 Difference]: Finished difference Result 402 states and 548 transitions. [2024-11-19 06:45:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:45:48,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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 16 [2024-11-19 06:45:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:48,340 INFO L225 Difference]: With dead ends: 402 [2024-11-19 06:45:48,340 INFO L226 Difference]: Without dead ends: 402 [2024-11-19 06:45:48,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:45:48,341 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 295 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:48,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 551 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:45:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-19 06:45:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 334. [2024-11-19 06:45:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 287 states have (on average 1.5574912891986064) internal successors, (447), 309 states have internal predecessors, (447), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2024-11-19 06:45:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 511 transitions. [2024-11-19 06:45:48,355 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 511 transitions. Word has length 16 [2024-11-19 06:45:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:48,355 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 511 transitions. [2024-11-19 06:45:48,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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-11-19 06:45:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 511 transitions. [2024-11-19 06:45:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:45:48,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:48,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:48,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:45:48,560 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-11-19 06:45:48,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1438689731, now seen corresponding path program 1 times [2024-11-19 06:45:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925560604] [2024-11-19 06:45:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:48,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:48,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925560604] [2024-11-19 06:45:48,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925560604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:48,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:48,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:45:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924676673] [2024-11-19 06:45:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:48,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:48,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:48,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:48,618 INFO L87 Difference]: Start difference. First operand 334 states and 511 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-11-19 06:45:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:48,647 INFO L93 Difference]: Finished difference Result 484 states and 745 transitions. [2024-11-19 06:45:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:48,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 18 [2024-11-19 06:45:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:48,651 INFO L225 Difference]: With dead ends: 484 [2024-11-19 06:45:48,653 INFO L226 Difference]: Without dead ends: 484 [2024-11-19 06:45:48,653 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-11-19 06:45:48,654 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 53 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:48,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 112 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-19 06:45:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 470. [2024-11-19 06:45:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 411 states have (on average 1.5547445255474452) internal successors, (639), 436 states have internal predecessors, (639), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2024-11-19 06:45:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 743 transitions. [2024-11-19 06:45:48,680 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 743 transitions. Word has length 18 [2024-11-19 06:45:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 743 transitions. [2024-11-19 06:45:48,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-11-19 06:45:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 743 transitions. [2024-11-19 06:45:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:45:48,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:48,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:48,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:45:48,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:48,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:48,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1438689987, now seen corresponding path program 1 times [2024-11-19 06:45:48,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:48,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123962176] [2024-11-19 06:45:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:48,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:48,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123962176] [2024-11-19 06:45:48,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123962176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:48,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:48,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:48,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636261006] [2024-11-19 06:45:48,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:48,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:48,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:48,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:48,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:48,723 INFO L87 Difference]: Start difference. First operand 470 states and 743 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-19 06:45:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:48,731 INFO L93 Difference]: Finished difference Result 432 states and 677 transitions. [2024-11-19 06:45:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18 [2024-11-19 06:45:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:48,733 INFO L225 Difference]: With dead ends: 432 [2024-11-19 06:45:48,734 INFO L226 Difference]: Without dead ends: 432 [2024-11-19 06:45:48,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:48,735 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:48,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-19 06:45:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-11-19 06:45:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 379 states have (on average 1.5118733509234827) internal successors, (573), 398 states have internal predecessors, (573), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2024-11-19 06:45:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 677 transitions. [2024-11-19 06:45:48,752 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 677 transitions. Word has length 18 [2024-11-19 06:45:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:48,752 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 677 transitions. [2024-11-19 06:45:48,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-19 06:45:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 677 transitions. [2024-11-19 06:45:48,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:45:48,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:48,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:48,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:45:48,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:48,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1649708773, now seen corresponding path program 1 times [2024-11-19 06:45:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333821532] [2024-11-19 06:45:48,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:48,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:48,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333821532] [2024-11-19 06:45:48,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333821532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:48,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:45:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162402808] [2024-11-19 06:45:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:48,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:48,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:48,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:48,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:48,801 INFO L87 Difference]: Start difference. First operand 432 states and 677 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-11-19 06:45:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:48,834 INFO L93 Difference]: Finished difference Result 448 states and 681 transitions. [2024-11-19 06:45:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:48,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 19 [2024-11-19 06:45:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:48,836 INFO L225 Difference]: With dead ends: 448 [2024-11-19 06:45:48,836 INFO L226 Difference]: Without dead ends: 448 [2024-11-19 06:45:48,837 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-11-19 06:45:48,837 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 38 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:48,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 90 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-19 06:45:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 435. [2024-11-19 06:45:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 382 states have (on average 1.5) internal successors, (573), 401 states have internal predecessors, (573), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2024-11-19 06:45:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 677 transitions. [2024-11-19 06:45:48,852 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 677 transitions. Word has length 19 [2024-11-19 06:45:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:48,852 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 677 transitions. [2024-11-19 06:45:48,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-11-19 06:45:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 677 transitions. [2024-11-19 06:45:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:45:48,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:48,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:48,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:45:48,854 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:48,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash -398635515, now seen corresponding path program 1 times [2024-11-19 06:45:48,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:48,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24987845] [2024-11-19 06:45:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24987845] [2024-11-19 06:45:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24987845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:48,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:45:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731911913] [2024-11-19 06:45:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:48,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:48,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:48,892 INFO L87 Difference]: Start difference. First operand 435 states and 677 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-11-19 06:45:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:48,916 INFO L93 Difference]: Finished difference Result 502 states and 759 transitions. [2024-11-19 06:45:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:48,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 20 [2024-11-19 06:45:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:48,919 INFO L225 Difference]: With dead ends: 502 [2024-11-19 06:45:48,919 INFO L226 Difference]: Without dead ends: 502 [2024-11-19 06:45:48,920 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-11-19 06:45:48,920 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 33 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 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-11-19 06:45:48,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:48,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-19 06:45:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2024-11-19 06:45:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 431 states have (on average 1.4965197215777262) internal successors, (645), 452 states have internal predecessors, (645), 20 states have call successors, (20), 15 states have call predecessors, (20), 22 states have return successors, (89), 20 states have call predecessors, (89), 20 states have call successors, (89) [2024-11-19 06:45:48,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 754 transitions. [2024-11-19 06:45:48,935 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 754 transitions. Word has length 20 [2024-11-19 06:45:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:48,935 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 754 transitions. [2024-11-19 06:45:48,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-11-19 06:45:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 754 transitions. [2024-11-19 06:45:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:45:48,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:48,937 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-11-19 06:45:48,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:45:48,937 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:48,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1948313302, now seen corresponding path program 1 times [2024-11-19 06:45:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216658989] [2024-11-19 06:45:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:48,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:48,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216658989] [2024-11-19 06:45:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216658989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:48,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122424187] [2024-11-19 06:45:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:48,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:48,967 INFO L87 Difference]: Start difference. First operand 488 states and 754 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-11-19 06:45:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:48,975 INFO L93 Difference]: Finished difference Result 350 states and 522 transitions. [2024-11-19 06:45:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:48,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11-19 06:45:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:48,977 INFO L225 Difference]: With dead ends: 350 [2024-11-19 06:45:48,977 INFO L226 Difference]: Without dead ends: 350 [2024-11-19 06:45:48,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:48,978 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:48,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 102 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-19 06:45:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-11-19 06:45:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 305 states have (on average 1.4688524590163934) internal successors, (448), 323 states have internal predecessors, (448), 15 states have call successors, (15), 11 states have call predecessors, (15), 15 states have return successors, (59), 15 states have call predecessors, (59), 15 states have call successors, (59) [2024-11-19 06:45:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 522 transitions. [2024-11-19 06:45:48,988 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 522 transitions. Word has length 25 [2024-11-19 06:45:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:48,989 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 522 transitions. [2024-11-19 06:45:48,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11-19 06:45:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 522 transitions. [2024-11-19 06:45:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:45:48,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:48,990 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, 1] [2024-11-19 06:45:48,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:45:48,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:48,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1793598830, now seen corresponding path program 1 times [2024-11-19 06:45:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:48,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941450885] [2024-11-19 06:45:48,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941450885] [2024-11-19 06:45:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941450885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:49,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184994763] [2024-11-19 06:45:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:49,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:49,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:49,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:49,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:45:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:49,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 06:45:49,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:49,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:49,653 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-11-19 06:45:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:49,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:49,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184994763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:49,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:49,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2024-11-19 06:45:49,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162918042] [2024-11-19 06:45:49,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:49,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:45:49,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:49,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:45:49,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:45:49,883 INFO L87 Difference]: Start difference. First operand 350 states and 522 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 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-11-19 06:45:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:50,328 INFO L93 Difference]: Finished difference Result 380 states and 536 transitions. [2024-11-19 06:45:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:45:50,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 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 27 [2024-11-19 06:45:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:50,330 INFO L225 Difference]: With dead ends: 380 [2024-11-19 06:45:50,330 INFO L226 Difference]: Without dead ends: 380 [2024-11-19 06:45:50,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:45:50,332 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 373 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:50,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 141 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-19 06:45:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 369. [2024-11-19 06:45:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 320 states have (on average 1.421875) internal successors, (455), 342 states have internal predecessors, (455), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-11-19 06:45:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 530 transitions. [2024-11-19 06:45:50,341 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 530 transitions. Word has length 27 [2024-11-19 06:45:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:50,342 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 530 transitions. [2024-11-19 06:45:50,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 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-11-19 06:45:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 530 transitions. [2024-11-19 06:45:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:45:50,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:50,343 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, 1, 1] [2024-11-19 06:45:50,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:45:50,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 06:45:50,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:50,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1075966913, now seen corresponding path program 1 times [2024-11-19 06:45:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:50,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682489130] [2024-11-19 06:45:50,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682489130] [2024-11-19 06:45:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682489130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476019108] [2024-11-19 06:45:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:50,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:50,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:50,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:50,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:45:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:50,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:45:50,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:50,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:45:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476019108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:45:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2024-11-19 06:45:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757742301] [2024-11-19 06:45:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:50,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:45:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:50,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:45:50,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:45:50,895 INFO L87 Difference]: Start difference. First operand 369 states and 530 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-19 06:45:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:50,960 INFO L93 Difference]: Finished difference Result 393 states and 550 transitions. [2024-11-19 06:45:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:45:50,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 28 [2024-11-19 06:45:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:50,962 INFO L225 Difference]: With dead ends: 393 [2024-11-19 06:45:50,963 INFO L226 Difference]: Without dead ends: 393 [2024-11-19 06:45:50,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:45:50,963 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 69 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:50,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 161 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-19 06:45:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 382. [2024-11-19 06:45:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 333 states have (on average 1.4054054054054055) internal successors, (468), 355 states have internal predecessors, (468), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-11-19 06:45:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 543 transitions. [2024-11-19 06:45:50,975 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 543 transitions. Word has length 28 [2024-11-19 06:45:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:50,975 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 543 transitions. [2024-11-19 06:45:50,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-19 06:45:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 543 transitions. [2024-11-19 06:45:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:45:50,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:50,976 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, 1, 1] [2024-11-19 06:45:50,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:45:51,177 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-11-19 06:45:51,178 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:51,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1366588429, now seen corresponding path program 1 times [2024-11-19 06:45:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:51,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588249403] [2024-11-19 06:45:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:51,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588249403] [2024-11-19 06:45:51,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588249403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532434633] [2024-11-19 06:45:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:51,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:51,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:51,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:51,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:45:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:51,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:45:51,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:52,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:52,004 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-11-19 06:45:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:52,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532434633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:52,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2024-11-19 06:45:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3080683] [2024-11-19 06:45:52,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:52,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:45:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:45:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:45:52,267 INFO L87 Difference]: Start difference. First operand 382 states and 543 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 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-11-19 06:45:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:52,731 INFO L93 Difference]: Finished difference Result 392 states and 544 transitions. [2024-11-19 06:45:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:45:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 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-11-19 06:45:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:52,734 INFO L225 Difference]: With dead ends: 392 [2024-11-19 06:45:52,734 INFO L226 Difference]: Without dead ends: 392 [2024-11-19 06:45:52,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2024-11-19 06:45:52,735 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 349 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:52,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 223 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:45:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-19 06:45:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 385. [2024-11-19 06:45:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 336 states have (on average 1.3869047619047619) internal successors, (466), 358 states have internal predecessors, (466), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-11-19 06:45:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 541 transitions. [2024-11-19 06:45:52,746 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 541 transitions. Word has length 29 [2024-11-19 06:45:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:52,747 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 541 transitions. [2024-11-19 06:45:52,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 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-11-19 06:45:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 541 transitions. [2024-11-19 06:45:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:45:52,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:52,748 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, 1, 1, 1, 1] [2024-11-19 06:45:52,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:45:52,949 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-11-19 06:45:52,949 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:52,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1661947307, now seen corresponding path program 1 times [2024-11-19 06:45:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606077061] [2024-11-19 06:45:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:53,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:53,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606077061] [2024-11-19 06:45:53,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606077061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:53,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444476330] [2024-11-19 06:45:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:53,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:53,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:53,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:53,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:45:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:53,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:45:53,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:53,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:45:53,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444476330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:53,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:45:53,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2024-11-19 06:45:53,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372276981] [2024-11-19 06:45:53,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:53,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:45:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:53,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:45:53,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:45:53,360 INFO L87 Difference]: Start difference. First operand 385 states and 541 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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-11-19 06:45:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:53,457 INFO L93 Difference]: Finished difference Result 374 states and 505 transitions. [2024-11-19 06:45:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:45:53,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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 30 [2024-11-19 06:45:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:53,459 INFO L225 Difference]: With dead ends: 374 [2024-11-19 06:45:53,459 INFO L226 Difference]: Without dead ends: 373 [2024-11-19 06:45:53,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:45:53,460 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 92 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:53,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 178 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-19 06:45:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 366. [2024-11-19 06:45:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 321 states have (on average 1.3894080996884735) internal successors, (446), 344 states have internal predecessors, (446), 12 states have call successors, (12), 9 states have call predecessors, (12), 18 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) [2024-11-19 06:45:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2024-11-19 06:45:53,471 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 30 [2024-11-19 06:45:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:53,471 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2024-11-19 06:45:53,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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-11-19 06:45:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2024-11-19 06:45:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:45:53,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:53,473 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, 1, 1] [2024-11-19 06:45:53,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 06:45:53,673 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-11-19 06:45:53,674 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash -585431614, now seen corresponding path program 1 times [2024-11-19 06:45:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:53,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993933262] [2024-11-19 06:45:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993933262] [2024-11-19 06:45:53,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993933262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:53,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758939741] [2024-11-19 06:45:53,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:53,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:53,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:53,866 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-11-19 06:45:53,867 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-11-19 06:45:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:53,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:45:53,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:54,042 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:45:54,043 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-11-19 06:45:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:54,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:54,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758939741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:54,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:54,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2024-11-19 06:45:54,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511057624] [2024-11-19 06:45:54,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:54,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:45:54,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:54,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:45:54,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:45:54,141 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 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-11-19 06:45:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:54,474 INFO L93 Difference]: Finished difference Result 498 states and 633 transitions. [2024-11-19 06:45:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:45:54,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 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 30 [2024-11-19 06:45:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:54,476 INFO L225 Difference]: With dead ends: 498 [2024-11-19 06:45:54,476 INFO L226 Difference]: Without dead ends: 498 [2024-11-19 06:45:54,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:45:54,477 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 518 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:54,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 286 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-19 06:45:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 443. [2024-11-19 06:45:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 395 states have (on average 1.3544303797468353) internal successors, (535), 419 states have internal predecessors, (535), 12 states have call successors, (12), 11 states have call predecessors, (12), 21 states have return successors, (41), 12 states have call predecessors, (41), 12 states have call successors, (41) [2024-11-19 06:45:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 588 transitions. [2024-11-19 06:45:54,500 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 588 transitions. Word has length 30 [2024-11-19 06:45:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:54,500 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 588 transitions. [2024-11-19 06:45:54,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 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-11-19 06:45:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 588 transitions. [2024-11-19 06:45:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:45:54,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:54,501 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, 1, 1] [2024-11-19 06:45:54,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 06:45:54,701 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-11-19 06:45:54,702 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:54,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash -968510801, now seen corresponding path program 1 times [2024-11-19 06:45:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903175553] [2024-11-19 06:45:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903175553] [2024-11-19 06:45:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903175553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:54,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330244834] [2024-11-19 06:45:54,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:54,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:54,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:54,921 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-11-19 06:45:54,924 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-11-19 06:45:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:55,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:45:55,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:55,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:55,146 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-11-19 06:45:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:55,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:55,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330244834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:55,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:55,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2024-11-19 06:45:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519195690] [2024-11-19 06:45:55,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:55,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:45:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:55,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:45:55,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:45:55,349 INFO L87 Difference]: Start difference. First operand 443 states and 588 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 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-11-19 06:45:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:55,979 INFO L93 Difference]: Finished difference Result 601 states and 738 transitions. [2024-11-19 06:45:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:45:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 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 31 [2024-11-19 06:45:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:55,982 INFO L225 Difference]: With dead ends: 601 [2024-11-19 06:45:55,982 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 06:45:55,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 06:45:55,983 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 422 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:55,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 333 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:45:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 06:45:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 546. [2024-11-19 06:45:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 493 states have (on average 1.3367139959432048) internal successors, (659), 521 states have internal predecessors, (659), 12 states have call successors, (12), 12 states have call predecessors, (12), 26 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-19 06:45:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 707 transitions. [2024-11-19 06:45:56,004 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 707 transitions. Word has length 31 [2024-11-19 06:45:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:56,004 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 707 transitions. [2024-11-19 06:45:56,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 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-11-19 06:45:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 707 transitions. [2024-11-19 06:45:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:45:56,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:56,006 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, 1] [2024-11-19 06:45:56,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 06:45:56,210 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-11-19 06:45:56,211 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:56,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash -235524555, now seen corresponding path program 1 times [2024-11-19 06:45:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:56,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937991276] [2024-11-19 06:45:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:56,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937991276] [2024-11-19 06:45:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937991276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144216519] [2024-11-19 06:45:56,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:56,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:56,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:56,448 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-11-19 06:45:56,450 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-11-19 06:45:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:56,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:45:56,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:56,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:56,799 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-11-19 06:45:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:56,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:57,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144216519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:57,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:57,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2024-11-19 06:45:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284205724] [2024-11-19 06:45:57,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:57,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:45:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:45:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:45:57,085 INFO L87 Difference]: Start difference. First operand 546 states and 707 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 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-11-19 06:45:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:57,561 INFO L93 Difference]: Finished difference Result 563 states and 701 transitions. [2024-11-19 06:45:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:45:57,562 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 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 35 [2024-11-19 06:45:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:57,564 INFO L225 Difference]: With dead ends: 563 [2024-11-19 06:45:57,565 INFO L226 Difference]: Without dead ends: 563 [2024-11-19 06:45:57,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 06:45:57,568 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 338 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:57,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 216 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-19 06:45:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 545. [2024-11-19 06:45:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 495 states have (on average 1.286868686868687) internal successors, (637), 520 states have internal predecessors, (637), 12 states have call successors, (12), 12 states have call predecessors, (12), 26 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-19 06:45:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 685 transitions. [2024-11-19 06:45:57,583 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 685 transitions. Word has length 35 [2024-11-19 06:45:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:57,583 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 685 transitions. [2024-11-19 06:45:57,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 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-11-19 06:45:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 685 transitions. [2024-11-19 06:45:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:45:57,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:57,584 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, 1, 1] [2024-11-19 06:45:57,602 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-11-19 06:45:57,788 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-11-19 06:45:57,789 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:57,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1961361480, now seen corresponding path program 1 times [2024-11-19 06:45:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:57,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36831918] [2024-11-19 06:45:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:57,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:45:57,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:57,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36831918] [2024-11-19 06:45:57,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36831918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:57,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757243377] [2024-11-19 06:45:57,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:57,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:57,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:57,934 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-11-19 06:45:57,935 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-11-19 06:45:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:57,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:45:58,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:58,172 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:45:58,173 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-11-19 06:45:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:45:58,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:58,276 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-11-19 06:45:58,442 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-11-19 06:45:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:45:58,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757243377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:58,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2024-11-19 06:45:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682992404] [2024-11-19 06:45:58,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:58,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:45:58,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:58,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:45:58,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:45:58,470 INFO L87 Difference]: Start difference. First operand 545 states and 685 transitions. Second operand has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-11-19 06:45:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:58,816 INFO L93 Difference]: Finished difference Result 593 states and 718 transitions. [2024-11-19 06:45:58,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:45:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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 36 [2024-11-19 06:45:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:58,822 INFO L225 Difference]: With dead ends: 593 [2024-11-19 06:45:58,822 INFO L226 Difference]: Without dead ends: 593 [2024-11-19 06:45:58,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:45:58,823 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 253 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:58,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 250 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-19 06:45:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 552. [2024-11-19 06:45:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 503 states have (on average 1.286282306163022) internal successors, (647), 527 states have internal predecessors, (647), 12 states have call successors, (12), 12 states have call predecessors, (12), 25 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2024-11-19 06:45:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 692 transitions. [2024-11-19 06:45:58,838 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 692 transitions. Word has length 36 [2024-11-19 06:45:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:58,838 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 692 transitions. [2024-11-19 06:45:58,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-11-19 06:45:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 692 transitions. [2024-11-19 06:45:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:45:58,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:58,839 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, 1, 1] [2024-11-19 06:45:58,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:45:59,040 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-11-19 06:45:59,040 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:45:59,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 672663717, now seen corresponding path program 1 times [2024-11-19 06:45:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243339866] [2024-11-19 06:45:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:59,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:59,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243339866] [2024-11-19 06:45:59,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243339866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:59,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673658952] [2024-11-19 06:45:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:59,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:59,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:59,443 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-11-19 06:45:59,445 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-11-19 06:45:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:59,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:45:59,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:59,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:00,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673658952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:00,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:00,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2024-11-19 06:46:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301296679] [2024-11-19 06:46:00,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:00,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 06:46:00,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:00,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 06:46:00,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:46:00,091 INFO L87 Difference]: Start difference. First operand 552 states and 692 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 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-11-19 06:46:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:01,447 INFO L93 Difference]: Finished difference Result 814 states and 983 transitions. [2024-11-19 06:46:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:46:01,448 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 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 37 [2024-11-19 06:46:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:01,451 INFO L225 Difference]: With dead ends: 814 [2024-11-19 06:46:01,451 INFO L226 Difference]: Without dead ends: 814 [2024-11-19 06:46:01,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=571, Invalid=2621, Unknown=0, NotChecked=0, Total=3192 [2024-11-19 06:46:01,453 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 814 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:01,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 554 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:46:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-19 06:46:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 555. [2024-11-19 06:46:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 508 states have (on average 1.2775590551181102) internal successors, (649), 532 states have internal predecessors, (649), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-19 06:46:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 691 transitions. [2024-11-19 06:46:01,474 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 691 transitions. Word has length 37 [2024-11-19 06:46:01,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:01,474 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 691 transitions. [2024-11-19 06:46:01,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 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-11-19 06:46:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 691 transitions. [2024-11-19 06:46:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:46:01,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:01,475 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:01,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:01,676 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-11-19 06:46:01,676 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:01,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1977086476, now seen corresponding path program 1 times [2024-11-19 06:46:01,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:01,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999519478] [2024-11-19 06:46:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:01,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999519478] [2024-11-19 06:46:01,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999519478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:01,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268747440] [2024-11-19 06:46:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:01,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:01,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:01,753 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-11-19 06:46:01,754 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-11-19 06:46:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:01,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:46:01,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:01,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:01,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268747440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:01,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:01,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-19 06:46:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022815817] [2024-11-19 06:46:01,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:01,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:46:01,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:01,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:46:01,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:01,899 INFO L87 Difference]: Start difference. First operand 555 states and 691 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-11-19 06:46:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:01,918 INFO L93 Difference]: Finished difference Result 553 states and 684 transitions. [2024-11-19 06:46:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:46:01,918 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 40 [2024-11-19 06:46:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:01,920 INFO L225 Difference]: With dead ends: 553 [2024-11-19 06:46:01,920 INFO L226 Difference]: Without dead ends: 553 [2024-11-19 06:46:01,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:01,921 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 37 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:01,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 86 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-19 06:46:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-19 06:46:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 508 states have (on average 1.263779527559055) internal successors, (642), 530 states have internal predecessors, (642), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-19 06:46:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 684 transitions. [2024-11-19 06:46:01,931 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 684 transitions. Word has length 40 [2024-11-19 06:46:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:01,931 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 684 transitions. [2024-11-19 06:46:01,932 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-11-19 06:46:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 684 transitions. [2024-11-19 06:46:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:46:01,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:01,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:01,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 06:46:02,136 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-11-19 06:46:02,137 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr20ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1160138508, now seen corresponding path program 1 times [2024-11-19 06:46:02,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:02,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857871645] [2024-11-19 06:46:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:02,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:02,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857871645] [2024-11-19 06:46:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857871645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:02,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618934394] [2024-11-19 06:46:02,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:02,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:02,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:02,220 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-11-19 06:46:02,222 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-11-19 06:46:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:02,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:46:02,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:02,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618934394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:02,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:02,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-19 06:46:02,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316171449] [2024-11-19 06:46:02,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:02,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:46:02,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:02,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:46:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:02,394 INFO L87 Difference]: Start difference. First operand 553 states and 684 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-11-19 06:46:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:02,427 INFO L93 Difference]: Finished difference Result 551 states and 677 transitions. [2024-11-19 06:46:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:46:02,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 41 [2024-11-19 06:46:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:02,429 INFO L225 Difference]: With dead ends: 551 [2024-11-19 06:46:02,429 INFO L226 Difference]: Without dead ends: 551 [2024-11-19 06:46:02,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:02,430 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 33 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:02,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 69 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-19 06:46:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 544. [2024-11-19 06:46:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 501 states have (on average 1.251497005988024) internal successors, (627), 521 states have internal predecessors, (627), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-19 06:46:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 669 transitions. [2024-11-19 06:46:02,442 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 669 transitions. Word has length 41 [2024-11-19 06:46:02,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:02,442 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 669 transitions. [2024-11-19 06:46:02,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-11-19 06:46:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 669 transitions. [2024-11-19 06:46:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:46:02,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:02,443 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:02,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 06:46:02,644 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-11-19 06:46:02,644 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr21ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1604555274, now seen corresponding path program 1 times [2024-11-19 06:46:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566002521] [2024-11-19 06:46:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:02,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:02,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566002521] [2024-11-19 06:46:02,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566002521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290705606] [2024-11-19 06:46:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:02,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:02,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:02,762 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-11-19 06:46:02,764 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-11-19 06:46:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:02,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:46:02,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:02,855 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-11-19 06:46:02,890 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:46:02,890 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 12 treesize of output 14 [2024-11-19 06:46:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:02,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290705606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:02,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:02,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-19 06:46:02,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861428571] [2024-11-19 06:46:02,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:02,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:46:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:02,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:46:02,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:02,943 INFO L87 Difference]: Start difference. First operand 544 states and 669 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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-11-19 06:46:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:02,997 INFO L93 Difference]: Finished difference Result 562 states and 678 transitions. [2024-11-19 06:46:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:02,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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 42 [2024-11-19 06:46:02,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:02,999 INFO L225 Difference]: With dead ends: 562 [2024-11-19 06:46:03,000 INFO L226 Difference]: Without dead ends: 562 [2024-11-19 06:46:03,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:03,000 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:03,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 124 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-19 06:46:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 544. [2024-11-19 06:46:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 501 states have (on average 1.2415169660678642) internal successors, (622), 521 states have internal predecessors, (622), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-19 06:46:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 664 transitions. [2024-11-19 06:46:03,017 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 664 transitions. Word has length 42 [2024-11-19 06:46:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:03,018 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 664 transitions. [2024-11-19 06:46:03,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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-11-19 06:46:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 664 transitions. [2024-11-19 06:46:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:46:03,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:03,019 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, 1, 1] [2024-11-19 06:46:03,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-19 06:46:03,220 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-11-19 06:46:03,220 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:03,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1106351333, now seen corresponding path program 1 times [2024-11-19 06:46:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228998827] [2024-11-19 06:46:03,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:03,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:46:03,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:03,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228998827] [2024-11-19 06:46:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228998827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051674653] [2024-11-19 06:46:03,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:03,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:03,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:03,272 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-11-19 06:46:03,273 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-11-19 06:46:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:03,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:46:03,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:46:03,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051674653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:03,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:46:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-19 06:46:03,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124606896] [2024-11-19 06:46:03,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:03,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:03,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:03,403 INFO L87 Difference]: Start difference. First operand 544 states and 664 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-11-19 06:46:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:03,427 INFO L93 Difference]: Finished difference Result 348 states and 404 transitions. [2024-11-19 06:46:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:03,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 45 [2024-11-19 06:46:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:03,429 INFO L225 Difference]: With dead ends: 348 [2024-11-19 06:46:03,429 INFO L226 Difference]: Without dead ends: 348 [2024-11-19 06:46:03,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:03,430 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 15 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 138 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-11-19 06:46:03,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 138 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-19 06:46:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 339. [2024-11-19 06:46:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 308 states have (on average 1.2045454545454546) internal successors, (371), 322 states have internal predecessors, (371), 8 states have call successors, (8), 8 states have call predecessors, (8), 15 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-19 06:46:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 396 transitions. [2024-11-19 06:46:03,436 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 396 transitions. Word has length 45 [2024-11-19 06:46:03,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:03,436 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 396 transitions. [2024-11-19 06:46:03,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-11-19 06:46:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 396 transitions. [2024-11-19 06:46:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:46:03,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:03,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:03,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:03,638 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-11-19 06:46:03,638 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:03,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash -746846498, now seen corresponding path program 1 times [2024-11-19 06:46:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805676099] [2024-11-19 06:46:03,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805676099] [2024-11-19 06:46:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805676099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002445136] [2024-11-19 06:46:03,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:03,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:03,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:03,867 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-11-19 06:46:03,868 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-11-19 06:46:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:03,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:46:03,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:04,065 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:46:04,065 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-11-19 06:46:04,157 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:04,157 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-11-19 06:46:04,185 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:46:04,185 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-11-19 06:46:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:04,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:04,279 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:46:04,279 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 110 treesize of output 105 [2024-11-19 06:46:04,481 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:46:04,481 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 110 treesize of output 105 [2024-11-19 06:46:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002445136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:04,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:04,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2024-11-19 06:46:04,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976964114] [2024-11-19 06:46:04,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:04,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:46:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:46:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:46:04,633 INFO L87 Difference]: Start difference. First operand 339 states and 396 transitions. Second operand has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:46:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:04,817 INFO L93 Difference]: Finished difference Result 348 states and 404 transitions. [2024-11-19 06:46:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:46:04,818 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2024-11-19 06:46:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:04,819 INFO L225 Difference]: With dead ends: 348 [2024-11-19 06:46:04,819 INFO L226 Difference]: Without dead ends: 348 [2024-11-19 06:46:04,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2024-11-19 06:46:04,820 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 251 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:04,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 171 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-19 06:46:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 338. [2024-11-19 06:46:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 308 states have (on average 1.198051948051948) internal successors, (369), 321 states have internal predecessors, (369), 8 states have call successors, (8), 8 states have call predecessors, (8), 15 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-19 06:46:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 394 transitions. [2024-11-19 06:46:04,826 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 394 transitions. Word has length 51 [2024-11-19 06:46:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:04,826 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 394 transitions. [2024-11-19 06:46:04,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:46:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 394 transitions. [2024-11-19 06:46:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:46:04,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:04,827 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:04,845 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-11-19 06:46:05,031 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-11-19 06:46:05,032 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:05,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2030471307, now seen corresponding path program 1 times [2024-11-19 06:46:05,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:05,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531299111] [2024-11-19 06:46:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531299111] [2024-11-19 06:46:05,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531299111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574705185] [2024-11-19 06:46:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:05,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:05,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:05,093 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-11-19 06:46:05,095 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-11-19 06:46:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:05,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:46:05,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:05,262 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_parse_input_c1_~x~0#1.base_77| Int)) (and (<= |v_parse_input_c1_~x~0#1.base_77| c_~global~0.base) (= |c_#valid| (store |c_old(#valid)| |v_parse_input_c1_~x~0#1.base_77| (select |c_#valid| |v_parse_input_c1_~x~0#1.base_77|))))) is different from true [2024-11-19 06:46:05,285 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:46:05,286 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-11-19 06:46:05,411 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:05,412 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-11-19 06:46:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 06:46:05,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574705185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:05,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 16 [2024-11-19 06:46:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41116878] [2024-11-19 06:46:05,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:05,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:46:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:05,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:46:05,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2024-11-19 06:46:05,535 INFO L87 Difference]: Start difference. First operand 338 states and 394 transitions. Second operand has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:06,181 INFO L93 Difference]: Finished difference Result 331 states and 363 transitions. [2024-11-19 06:46:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 06:46:06,182 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 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 51 [2024-11-19 06:46:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:06,183 INFO L225 Difference]: With dead ends: 331 [2024-11-19 06:46:06,183 INFO L226 Difference]: Without dead ends: 331 [2024-11-19 06:46:06,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=356, Invalid=1369, Unknown=1, NotChecked=80, Total=1806 [2024-11-19 06:46:06,185 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 362 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:06,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 445 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 480 Invalid, 0 Unknown, 217 Unchecked, 0.3s Time] [2024-11-19 06:46:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-19 06:46:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 295. [2024-11-19 06:46:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 269 states have (on average 1.174721189591078) internal successors, (316), 280 states have internal predecessors, (316), 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-11-19 06:46:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 336 transitions. [2024-11-19 06:46:06,199 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 336 transitions. Word has length 51 [2024-11-19 06:46:06,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:06,199 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 336 transitions. [2024-11-19 06:46:06,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 336 transitions. [2024-11-19 06:46:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:46:06,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:06,200 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:06,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:06,400 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-11-19 06:46:06,400 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1677404977, now seen corresponding path program 1 times [2024-11-19 06:46:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715379045] [2024-11-19 06:46:06,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:07,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:07,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715379045] [2024-11-19 06:46:07,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715379045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:07,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039755566] [2024-11-19 06:46:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:07,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:07,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:07,030 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-11-19 06:46:07,033 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-11-19 06:46:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:07,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 06:46:07,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:07,364 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:46:07,364 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-11-19 06:46:07,562 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:07,562 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-11-19 06:46:07,620 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:46:07,620 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-11-19 06:46:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:07,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:07,831 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-19 06:46:07,831 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 178 treesize of output 165 [2024-11-19 06:46:08,066 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-11-19 06:46:08,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 185 [2024-11-19 06:46:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039755566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:08,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 14] total 42 [2024-11-19 06:46:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086397733] [2024-11-19 06:46:08,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:08,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-19 06:46:08,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-19 06:46:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1611, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 06:46:08,340 INFO L87 Difference]: Start difference. First operand 295 states and 336 transitions. Second operand has 43 states, 39 states have (on average 3.58974358974359) internal successors, (140), 35 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:46:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:09,021 INFO L93 Difference]: Finished difference Result 307 states and 345 transitions. [2024-11-19 06:46:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:46:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 3.58974358974359) internal successors, (140), 35 states have internal predecessors, (140), 8 states have call successors, (9), 9 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 52 [2024-11-19 06:46:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:09,023 INFO L225 Difference]: With dead ends: 307 [2024-11-19 06:46:09,023 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 06:46:09,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=457, Invalid=2299, Unknown=0, NotChecked=0, Total=2756 [2024-11-19 06:46:09,024 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 489 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:09,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 355 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:46:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 06:46:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 295. [2024-11-19 06:46:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 269 states have (on average 1.1672862453531598) internal successors, (314), 280 states have internal predecessors, (314), 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-11-19 06:46:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 334 transitions. [2024-11-19 06:46:09,031 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 334 transitions. Word has length 52 [2024-11-19 06:46:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:09,032 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 334 transitions. [2024-11-19 06:46:09,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 3.58974358974359) internal successors, (140), 35 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:46:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 334 transitions. [2024-11-19 06:46:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 06:46:09,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:09,035 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:09,053 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-11-19 06:46:09,239 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-11-19 06:46:09,240 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:09,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:09,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1614101557, now seen corresponding path program 1 times [2024-11-19 06:46:09,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:09,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307368034] [2024-11-19 06:46:09,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:09,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:46:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:09,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307368034] [2024-11-19 06:46:09,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307368034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:09,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752943471] [2024-11-19 06:46:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:09,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:09,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:09,481 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-11-19 06:46:09,482 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-11-19 06:46:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:09,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:46:09,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:09,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:09,678 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-11-19 06:46:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:46:09,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:09,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752943471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:09,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:09,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2024-11-19 06:46:09,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029968781] [2024-11-19 06:46:09,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:09,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:46:09,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:09,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:46:09,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:46:09,969 INFO L87 Difference]: Start difference. First operand 295 states and 334 transitions. Second operand has 17 states, 14 states have (on average 5.714285714285714) internal successors, (80), 12 states have internal predecessors, (80), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:10,456 INFO L93 Difference]: Finished difference Result 308 states and 339 transitions. [2024-11-19 06:46:10,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:46:10,456 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 5.714285714285714) internal successors, (80), 12 states have internal predecessors, (80), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2024-11-19 06:46:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:10,458 INFO L225 Difference]: With dead ends: 308 [2024-11-19 06:46:10,458 INFO L226 Difference]: Without dead ends: 308 [2024-11-19 06:46:10,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 06:46:10,459 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 240 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:10,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 302 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-19 06:46:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 294. [2024-11-19 06:46:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 269 states have (on average 1.137546468401487) internal successors, (306), 279 states have internal predecessors, (306), 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-11-19 06:46:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 326 transitions. [2024-11-19 06:46:10,463 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 326 transitions. Word has length 53 [2024-11-19 06:46:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:10,464 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 326 transitions. [2024-11-19 06:46:10,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 5.714285714285714) internal successors, (80), 12 states have internal predecessors, (80), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 326 transitions. [2024-11-19 06:46:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:46:10,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:10,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:10,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-19 06:46:10,665 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-11-19 06:46:10,665 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:10,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1373445455, now seen corresponding path program 1 times [2024-11-19 06:46:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400371988] [2024-11-19 06:46:10,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:10,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:11,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:11,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400371988] [2024-11-19 06:46:11,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400371988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:11,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919190684] [2024-11-19 06:46:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:11,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:11,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:11,015 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-11-19 06:46:11,016 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-11-19 06:46:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:11,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:46:11,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:11,187 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:11,188 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-11-19 06:46:11,404 INFO L349 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2024-11-19 06:46:11,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2024-11-19 06:46:11,487 INFO L349 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2024-11-19 06:46:11,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 64 [2024-11-19 06:46:11,503 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-19 06:46:11,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 1 [2024-11-19 06:46:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:11,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919190684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:11,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-19 06:46:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974011638] [2024-11-19 06:46:11,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:11,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 06:46:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 06:46:11,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:46:11,637 INFO L87 Difference]: Start difference. First operand 294 states and 326 transitions. Second operand has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:46:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:12,191 INFO L93 Difference]: Finished difference Result 304 states and 335 transitions. [2024-11-19 06:46:12,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:46:12,191 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-19 06:46:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:12,193 INFO L225 Difference]: With dead ends: 304 [2024-11-19 06:46:12,193 INFO L226 Difference]: Without dead ends: 304 [2024-11-19 06:46:12,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=908, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 06:46:12,194 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 339 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:12,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 304 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:46:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-19 06:46:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 293. [2024-11-19 06:46:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 269 states have (on average 1.1301115241635689) internal successors, (304), 278 states have internal predecessors, (304), 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-11-19 06:46:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 324 transitions. [2024-11-19 06:46:12,199 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 324 transitions. Word has length 54 [2024-11-19 06:46:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:12,199 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 324 transitions. [2024-11-19 06:46:12,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:46:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 324 transitions. [2024-11-19 06:46:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 06:46:12,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:12,202 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:12,222 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-11-19 06:46:12,403 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-11-19 06:46:12,403 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:12,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 980665832, now seen corresponding path program 1 times [2024-11-19 06:46:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:12,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612361201] [2024-11-19 06:46:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:12,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612361201] [2024-11-19 06:46:12,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612361201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:12,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144812590] [2024-11-19 06:46:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:12,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:12,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:12,923 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-11-19 06:46:12,924 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-11-19 06:46:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:13,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 06:46:13,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:13,322 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:13,322 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-11-19 06:46:13,831 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2024-11-19 06:46:13,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 67 [2024-11-19 06:46:13,879 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:46:13,894 INFO L349 Elim1Store]: treesize reduction 38, result has 20.8 percent of original size [2024-11-19 06:46:13,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 06:46:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:14,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144812590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:14,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:14,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 30 [2024-11-19 06:46:14,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021117404] [2024-11-19 06:46:14,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:14,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 06:46:14,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:14,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 06:46:14,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 06:46:14,626 INFO L87 Difference]: Start difference. First operand 293 states and 324 transitions. Second operand has 32 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:16,266 INFO L93 Difference]: Finished difference Result 310 states and 338 transitions. [2024-11-19 06:46:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 06:46:16,267 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 6 states have call successors, (6), 6 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 60 [2024-11-19 06:46:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:16,268 INFO L225 Difference]: With dead ends: 310 [2024-11-19 06:46:16,268 INFO L226 Difference]: Without dead ends: 310 [2024-11-19 06:46:16,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=646, Invalid=3136, Unknown=0, NotChecked=0, Total=3782 [2024-11-19 06:46:16,270 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 345 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:16,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 669 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 06:46:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-19 06:46:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 292. [2024-11-19 06:46:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 269 states have (on average 1.1226765799256506) internal successors, (302), 277 states have internal predecessors, (302), 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-11-19 06:46:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 322 transitions. [2024-11-19 06:46:16,275 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 322 transitions. Word has length 60 [2024-11-19 06:46:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:16,275 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 322 transitions. [2024-11-19 06:46:16,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 322 transitions. [2024-11-19 06:46:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 06:46:16,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:16,277 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:16,294 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-11-19 06:46:16,481 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-11-19 06:46:16,482 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:16,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:16,482 INFO L85 PathProgramCache]: Analyzing trace with hash 335869765, now seen corresponding path program 1 times [2024-11-19 06:46:16,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:16,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445387115] [2024-11-19 06:46:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:16,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:17,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445387115] [2024-11-19 06:46:17,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445387115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:17,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028936554] [2024-11-19 06:46:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:17,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:17,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:17,031 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:17,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-19 06:46:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:17,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 06:46:17,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:17,375 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:17,376 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-11-19 06:46:17,380 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-11-19 06:46:17,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:17,647 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-11-19 06:46:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 06:46:17,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:18,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028936554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:18,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:18,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 23 [2024-11-19 06:46:18,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939131890] [2024-11-19 06:46:18,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:18,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 06:46:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:18,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 06:46:18,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:46:18,045 INFO L87 Difference]: Start difference. First operand 292 states and 322 transitions. Second operand has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:46:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:18,948 INFO L93 Difference]: Finished difference Result 319 states and 348 transitions. [2024-11-19 06:46:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:46:18,948 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 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 61 [2024-11-19 06:46:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:18,949 INFO L225 Difference]: With dead ends: 319 [2024-11-19 06:46:18,950 INFO L226 Difference]: Without dead ends: 319 [2024-11-19 06:46:18,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=415, Invalid=2035, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:46:18,951 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 305 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:18,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 305 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:46:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-19 06:46:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 250. [2024-11-19 06:46:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 232 states have (on average 1.1120689655172413) internal successors, (258), 237 states have internal predecessors, (258), 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-11-19 06:46:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 273 transitions. [2024-11-19 06:46:18,956 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 273 transitions. Word has length 61 [2024-11-19 06:46:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:18,956 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 273 transitions. [2024-11-19 06:46:18,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:46:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 273 transitions. [2024-11-19 06:46:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 06:46:18,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:18,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:18,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-19 06:46:19,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:19,158 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting parse_inputErr21ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:19,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1691180133, now seen corresponding path program 1 times [2024-11-19 06:46:19,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043234238] [2024-11-19 06:46:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:19,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:19,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043234238] [2024-11-19 06:46:19,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043234238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394322305] [2024-11-19 06:46:19,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:19,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:19,396 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:19,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-19 06:46:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:19,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 06:46:19,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:19,507 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-11-19 06:46:19,626 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:19,627 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 3 case distinctions, treesize of input 22 treesize of output 16 [2024-11-19 06:46:19,646 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:46:19,647 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 12 treesize of output 14 [2024-11-19 06:46:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:19,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394322305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:19,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:19,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-19 06:46:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700203354] [2024-11-19 06:46:19,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:19,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:46:19,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:19,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:46:19,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:46:19,713 INFO L87 Difference]: Start difference. First operand 250 states and 273 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:46:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:19,878 INFO L93 Difference]: Finished difference Result 309 states and 338 transitions. [2024-11-19 06:46:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:46:19,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2024-11-19 06:46:19,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:19,880 INFO L225 Difference]: With dead ends: 309 [2024-11-19 06:46:19,880 INFO L226 Difference]: Without dead ends: 309 [2024-11-19 06:46:19,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:46:19,881 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 30 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:19,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 257 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-19 06:46:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 296. [2024-11-19 06:46:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 274 states have (on average 1.1131386861313868) internal successors, (305), 281 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-11-19 06:46:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 325 transitions. [2024-11-19 06:46:19,886 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 325 transitions. Word has length 66 [2024-11-19 06:46:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:19,887 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 325 transitions. [2024-11-19 06:46:19,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:46:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 325 transitions. [2024-11-19 06:46:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 06:46:19,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:19,888 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:19,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-19 06:46:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:20,093 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:20,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1915923850, now seen corresponding path program 1 times [2024-11-19 06:46:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374677693] [2024-11-19 06:46:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:46:20,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:46:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:46:20,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:46:20,157 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:46:20,158 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 23 remaining) [2024-11-19 06:46:20,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-11-19 06:46:20,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-11-19 06:46:20,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-11-19 06:46:20,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-11-19 06:46:20,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-11-19 06:46:20,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-11-19 06:46:20,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-11-19 06:46:20,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-11-19 06:46:20,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-11-19 06:46:20,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-11-19 06:46:20,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (11 of 23 remaining) [2024-11-19 06:46:20,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (10 of 23 remaining) [2024-11-19 06:46:20,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (9 of 23 remaining) [2024-11-19 06:46:20,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (8 of 23 remaining) [2024-11-19 06:46:20,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (7 of 23 remaining) [2024-11-19 06:46:20,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2024-11-19 06:46:20,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2024-11-19 06:46:20,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2024-11-19 06:46:20,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2024-11-19 06:46:20,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr19ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2024-11-19 06:46:20,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr20ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2024-11-19 06:46:20,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr21ASSERT_VIOLATIONMEMORY_FREE (0 of 23 remaining) [2024-11-19 06:46:20,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 06:46:20,165 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:20,245 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:46:20,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:46:20 BoogieIcfgContainer [2024-11-19 06:46:20,248 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:46:20,249 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:46:20,249 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:46:20,249 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:46:20,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:45:42" (3/4) ... [2024-11-19 06:46:20,257 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 06:46:20,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:46:20,262 INFO L158 Benchmark]: Toolchain (without parser) took 38661.68ms. Allocated memory was 176.2MB in the beginning and 522.2MB in the end (delta: 346.0MB). Free memory was 102.4MB in the beginning and 396.3MB in the end (delta: -293.9MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-11-19 06:46:20,262 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:46:20,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.30ms. Allocated memory is still 176.2MB. Free memory was 102.3MB in the beginning and 135.1MB in the end (delta: -32.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-19 06:46:20,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.19ms. Allocated memory is still 176.2MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:46:20,263 INFO L158 Benchmark]: Boogie Preprocessor took 51.80ms. Allocated memory is still 176.2MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:46:20,263 INFO L158 Benchmark]: RCFGBuilder took 480.92ms. Allocated memory is still 176.2MB. Free memory was 130.9MB in the beginning and 112.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 06:46:20,263 INFO L158 Benchmark]: TraceAbstraction took 37494.90ms. Allocated memory was 176.2MB in the beginning and 522.2MB in the end (delta: 346.0MB). Free memory was 111.0MB in the beginning and 397.4MB in the end (delta: -286.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2024-11-19 06:46:20,263 INFO L158 Benchmark]: Witness Printer took 9.79ms. Allocated memory is still 522.2MB. Free memory was 397.4MB in the beginning and 396.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:46:20,264 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.15ms. Allocated memory is still 113.2MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.30ms. Allocated memory is still 176.2MB. Free memory was 102.3MB in the beginning and 135.1MB in the end (delta: -32.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.19ms. Allocated memory is still 176.2MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.80ms. Allocated memory is still 176.2MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.92ms. Allocated memory is still 176.2MB. Free memory was 130.9MB in the beginning and 112.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 37494.90ms. Allocated memory was 176.2MB in the beginning and 522.2MB in the end (delta: 346.0MB). Free memory was 111.0MB in the beginning and 397.4MB in the end (delta: -286.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 9.79ms. Allocated memory is still 522.2MB. Free memory was 397.4MB in the beginning and 396.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 722]: 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 722. 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} }; VAL [commands={6:0}, global={0:0}, state=0] [L723] 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 VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, input={3:0}, state=0] [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={7:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, 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("c1") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7: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={7: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={7: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={7: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={7: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={7: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={7:0}, i=0, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={4:0}, state=1] [L692] COND FALSE !(i < 2) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, input={4:0}, state=1] [L724] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L725] 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 FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, input={5:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={5:0}, state=1] [L692] COND FALSE !(i < 2) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, input={5:0}, state=1] [L725] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L726] return 0; VAL [\result=0, commands={6:0}, global={7: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: 715]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 715]: 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. - UnprovableResult [Line: 719]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: 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, 68 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 37.4s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7157 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7157 mSDsluCounter, 8699 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 217 IncrementalHoareTripleChecker+Unchecked, 6898 mSDsCounter, 840 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8586 IncrementalHoareTripleChecker+Invalid, 9643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 840 mSolverCounterUnsat, 1801 mSDtfsCounter, 8586 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1881 GetRequests, 1234 SyntacticMatches, 9 SemanticMatches, 638 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4749 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=555occurred in iteration=23, InterpolantAutomatonStates: 374, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 1081 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 2103 NumberOfCodeBlocks, 2103 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2309 ConstructedInterpolants, 154 QuantifiedInterpolants, 27207 SizeOfPredicates, 92 NumberOfNonLiveVariables, 6036 ConjunctsInSsa, 454 ConjunctsInUnsatCore, 69 InterpolantComputations, 14 PerfectInterpolantSequences, 408/1071 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 06:46:20,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.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 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:46:22,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:46:22,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:46:22,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:46:22,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:46:22,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:46:22,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:46:22,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:46:22,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:46:22,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:46:22,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:46:22,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:46:22,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:46:22,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:46:22,631 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:46:22,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:46:22,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:46:22,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:46:22,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:46:22,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:46:22,632 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:46:22,636 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:46:22,636 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:46:22,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:46:22,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:46:22,637 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:46:22,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:46:22,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:46:22,638 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:46:22,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:46:22,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:46:22,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:46:22,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:46:22,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:46:22,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:46:22,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:46:22,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:46:22,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:46:22,640 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:46:22,640 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:46:22,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:46:22,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:46:22,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:46:22,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:46:22,642 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 -> 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c [2024-11-19 06:46:22,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:46:22,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:46:22,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:46:22,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:46:22,983 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:46:22,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-11-19 06:46:24,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:46:24,850 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:46:24,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2024-11-19 06:46:24,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ef3742d/0b270ba3488e4b8baa275f7f6277c79f/FLAG8d311bb47 [2024-11-19 06:46:24,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ef3742d/0b270ba3488e4b8baa275f7f6277c79f [2024-11-19 06:46:24,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:46:24,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:46:24,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:46:24,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:46:24,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:46:24,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:24" (1/1) ... [2024-11-19 06:46:24,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a01862d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:24, skipping insertion in model container [2024-11-19 06:46:24,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:24" (1/1) ... [2024-11-19 06:46:24,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:46:25,340 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:46:25,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:46:25,369 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:46:25,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:46:25,466 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:46:25,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25 WrapperNode [2024-11-19 06:46:25,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:46:25,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:46:25,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:46:25,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:46:25,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,513 INFO L138 Inliner]: procedures = 169, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 100 [2024-11-19 06:46:25,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:46:25,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:46:25,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:46:25,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:46:25,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,557 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-11-19 06:46:25,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:46:25,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:46:25,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:46:25,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:46:25,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (1/1) ... [2024-11-19 06:46:25,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:46:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:25,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:46:25,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:46:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:46:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:46:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 06:46:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-19 06:46:25,675 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-19 06:46:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:46:25,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:46:25,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:46:25,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:46:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:46:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:46:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:46:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:46:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:46:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:46:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:46:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 06:46:25,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:46:25,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:46:25,822 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:46:25,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:46:26,179 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-19 06:46:26,179 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:46:26,193 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:46:26,193 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 06:46:26,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:26 BoogieIcfgContainer [2024-11-19 06:46:26,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:46:26,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:46:26,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:46:26,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:46:26,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:46:24" (1/3) ... [2024-11-19 06:46:26,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23816149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:26, skipping insertion in model container [2024-11-19 06:46:26,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:25" (2/3) ... [2024-11-19 06:46:26,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23816149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:26, skipping insertion in model container [2024-11-19 06:46:26,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:26" (3/3) ... [2024-11-19 06:46:26,202 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2024-11-19 06:46:26,219 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:46:26,219 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-19 06:46:26,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:46:26,275 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;@772c97cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:46:26,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-19 06:46:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 40 states have (on average 1.775) internal successors, (71), 63 states have internal predecessors, (71), 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-11-19 06:46:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:46:26,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:26,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:46:26,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -565372166, now seen corresponding path program 1 times [2024-11-19 06:46:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:26,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944713339] [2024-11-19 06:46:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:26,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:26,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:26,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:26,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:46:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:26,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:46:26,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:26,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:26,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944713339] [2024-11-19 06:46:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944713339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:26,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:46:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159193628] [2024-11-19 06:46:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:26,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:46:26,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:26,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:46:26,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:26,592 INFO L87 Difference]: Start difference. First operand has 68 states, 40 states have (on average 1.775) internal successors, (71), 63 states have internal predecessors, (71), 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.5) internal successors, (5), 2 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-11-19 06:46:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:26,769 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2024-11-19 06:46:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:46:26,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-11-19 06:46:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:26,782 INFO L225 Difference]: With dead ends: 123 [2024-11-19 06:46:26,782 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 06:46:26,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:26,788 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:26,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 111 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 06:46:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2024-11-19 06:46:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.7) internal successors, (102), 82 states have internal predecessors, (102), 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-11-19 06:46:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2024-11-19 06:46:26,842 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 6 [2024-11-19 06:46:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:26,842 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2024-11-19 06:46:26,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-11-19 06:46:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2024-11-19 06:46:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:46:26,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:26,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:46:26,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:46:27,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:27,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:27,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash -565372165, now seen corresponding path program 1 times [2024-11-19 06:46:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:27,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788144487] [2024-11-19 06:46:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:27,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:27,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:27,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:27,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:46:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:27,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:46:27,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:27,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:27,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:27,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788144487] [2024-11-19 06:46:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788144487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:27,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:27,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:46:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789379336] [2024-11-19 06:46:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:27,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:46:27,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:27,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:46:27,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:27,258 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-19 06:46:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:27,476 INFO L93 Difference]: Finished difference Result 191 states and 251 transitions. [2024-11-19 06:46:27,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:46:27,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-19 06:46:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:27,478 INFO L225 Difference]: With dead ends: 191 [2024-11-19 06:46:27,479 INFO L226 Difference]: Without dead ends: 191 [2024-11-19 06:46:27,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-19 06:46:27,483 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 76 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:27,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 174 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-19 06:46:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 160. [2024-11-19 06:46:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 146 states have internal predecessors, (216), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 247 transitions. [2024-11-19 06:46:27,510 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 247 transitions. Word has length 6 [2024-11-19 06:46:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:27,510 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 247 transitions. [2024-11-19 06:46:27,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-19 06:46:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 247 transitions. [2024-11-19 06:46:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:46:27,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:27,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:27,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:46:27,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:27,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash -346667981, now seen corresponding path program 1 times [2024-11-19 06:46:27,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:27,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298296264] [2024-11-19 06:46:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:27,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:27,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:27,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:27,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:46:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:27,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:46:27,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:27,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:27,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:27,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298296264] [2024-11-19 06:46:27,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298296264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:27,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:27,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50344165] [2024-11-19 06:46:27,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:27,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:27,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:27,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:27,946 INFO L87 Difference]: Start difference. First operand 160 states and 247 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-11-19 06:46:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:28,180 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2024-11-19 06:46:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:28,180 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-11-19 06:46:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:28,184 INFO L225 Difference]: With dead ends: 211 [2024-11-19 06:46:28,184 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 06:46:28,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-19 06:46:28,186 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 85 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:28,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 177 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 06:46:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 163. [2024-11-19 06:46:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 127 states have (on average 1.7244094488188977) internal successors, (219), 149 states have internal predecessors, (219), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 250 transitions. [2024-11-19 06:46:28,214 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 250 transitions. Word has length 7 [2024-11-19 06:46:28,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:28,215 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 250 transitions. [2024-11-19 06:46:28,215 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-11-19 06:46:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-19 06:46:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:46:28,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:28,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:28,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 06:46:28,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:28,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:28,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2138194522, now seen corresponding path program 1 times [2024-11-19 06:46:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:28,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991397487] [2024-11-19 06:46:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:28,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:28,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:28,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:28,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:46:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:28,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:46:28,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:28,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-11-19 06:46:28,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:28,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:28,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991397487] [2024-11-19 06:46:28,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991397487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:28,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:28,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:28,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849151195] [2024-11-19 06:46:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:28,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:28,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:28,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:28,663 INFO L87 Difference]: Start difference. First operand 163 states and 250 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-19 06:46:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:28,879 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2024-11-19 06:46:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:28,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-19 06:46:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:28,881 INFO L225 Difference]: With dead ends: 193 [2024-11-19 06:46:28,882 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 06:46:28,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-11-19 06:46:28,883 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 90 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:28,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 208 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 06:46:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 163. [2024-11-19 06:46:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 149 states have internal predecessors, (217), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-11-19 06:46:28,904 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 8 [2024-11-19 06:46:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:28,904 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-11-19 06:46:28,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-19 06:46:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-11-19 06:46:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:46:28,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:28,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:28,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:46:29,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:29,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:29,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:29,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1859520789, now seen corresponding path program 1 times [2024-11-19 06:46:29,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:29,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334935169] [2024-11-19 06:46:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:29,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:29,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:29,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:29,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:46:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:29,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:46:29,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:29,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:29,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:29,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334935169] [2024-11-19 06:46:29,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334935169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:29,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:29,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:29,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656423525] [2024-11-19 06:46:29,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:29,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:29,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:29,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:29,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:29,241 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-11-19 06:46:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:29,410 INFO L93 Difference]: Finished difference Result 258 states and 351 transitions. [2024-11-19 06:46:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:29,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-11-19 06:46:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:29,412 INFO L225 Difference]: With dead ends: 258 [2024-11-19 06:46:29,414 INFO L226 Difference]: Without dead ends: 258 [2024-11-19 06:46:29,414 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-11-19 06:46:29,419 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:29,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 210 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-19 06:46:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 197. [2024-11-19 06:46:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.6603773584905661) internal successors, (264), 182 states have internal predecessors, (264), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2024-11-19 06:46:29,431 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 9 [2024-11-19 06:46:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:29,431 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2024-11-19 06:46:29,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-11-19 06:46:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2024-11-19 06:46:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:46:29,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:29,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:29,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 06:46:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:29,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:29,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:29,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1810569660, now seen corresponding path program 1 times [2024-11-19 06:46:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142862414] [2024-11-19 06:46:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:29,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-11-19 06:46:29,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:29,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:29,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 (7)] Waiting until timeout for monitored process [2024-11-19 06:46:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:29,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:46:29,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:29,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:29,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142862414] [2024-11-19 06:46:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142862414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:29,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:29,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769813779] [2024-11-19 06:46:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:29,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:29,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:29,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:29,793 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-11-19 06:46:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:29,962 INFO L93 Difference]: Finished difference Result 247 states and 318 transitions. [2024-11-19 06:46:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:29,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-11-19 06:46:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:29,973 INFO L225 Difference]: With dead ends: 247 [2024-11-19 06:46:29,973 INFO L226 Difference]: Without dead ends: 247 [2024-11-19 06:46:29,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11-19 06:46:29,974 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 183 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:29,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 210 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-19 06:46:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 211. [2024-11-19 06:46:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 172 states have (on average 1.6569767441860466) internal successors, (285), 196 states have internal predecessors, (285), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2024-11-19 06:46:29,984 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 316 transitions. Word has length 10 [2024-11-19 06:46:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:29,984 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 316 transitions. [2024-11-19 06:46:29,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-11-19 06:46:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 316 transitions. [2024-11-19 06:46:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:46:29,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:29,985 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:29,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:46:30,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:30,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:30,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash -381204798, now seen corresponding path program 1 times [2024-11-19 06:46:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247026543] [2024-11-19 06:46:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:30,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:30,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:30,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:30,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:46:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:30,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:46:30,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:30,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:30,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:30,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247026543] [2024-11-19 06:46:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247026543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:30,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:30,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-11-19 06:46:30,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449862266] [2024-11-19 06:46:30,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:30,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:46:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:30,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:46:30,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:46:30,677 INFO L87 Difference]: Start difference. First operand 211 states and 316 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-11-19 06:46:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:31,033 INFO L93 Difference]: Finished difference Result 282 states and 373 transitions. [2024-11-19 06:46:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:46:31,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-11-19 06:46:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:31,036 INFO L225 Difference]: With dead ends: 282 [2024-11-19 06:46:31,036 INFO L226 Difference]: Without dead ends: 282 [2024-11-19 06:46:31,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:46:31,037 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 224 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:31,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 246 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:46:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-19 06:46:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 241. [2024-11-19 06:46:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 202 states have (on average 1.6485148514851484) internal successors, (333), 226 states have internal predecessors, (333), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 364 transitions. [2024-11-19 06:46:31,047 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 364 transitions. Word has length 14 [2024-11-19 06:46:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:31,047 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 364 transitions. [2024-11-19 06:46:31,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-11-19 06:46:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 364 transitions. [2024-11-19 06:46:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:46:31,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:31,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:31,052 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-11-19 06:46:31,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:31,249 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:31,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:31,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1067553100, now seen corresponding path program 1 times [2024-11-19 06:46:31,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:31,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524433850] [2024-11-19 06:46:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:31,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:31,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:46:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:31,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:46:31,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:31,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:31,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:31,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524433850] [2024-11-19 06:46:31,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524433850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:31,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:31,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-19 06:46:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492334163] [2024-11-19 06:46:31,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:31,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:46:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:31,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:46:31,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:46:31,641 INFO L87 Difference]: Start difference. First operand 241 states and 364 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-11-19 06:46:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:32,060 INFO L93 Difference]: Finished difference Result 306 states and 436 transitions. [2024-11-19 06:46:32,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:46:32,061 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-11-19 06:46:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:32,063 INFO L225 Difference]: With dead ends: 306 [2024-11-19 06:46:32,063 INFO L226 Difference]: Without dead ends: 306 [2024-11-19 06:46:32,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 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-11-19 06:46:32,064 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 179 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:32,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 299 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:46:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-19 06:46:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2024-11-19 06:46:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 212 states have (on average 1.6415094339622642) internal successors, (348), 236 states have internal predecessors, (348), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2024-11-19 06:46:32,079 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 15 [2024-11-19 06:46:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:32,079 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2024-11-19 06:46:32,079 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-11-19 06:46:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2024-11-19 06:46:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:46:32,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:32,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:32,085 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-11-19 06:46:32,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:32,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:32,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:32,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1265592223, now seen corresponding path program 1 times [2024-11-19 06:46:32,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:32,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373304182] [2024-11-19 06:46:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:32,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:32,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:32,284 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:32,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:46:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:32,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:46:32,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:32,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:32,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373304182] [2024-11-19 06:46:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373304182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:32,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:32,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-19 06:46:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936183498] [2024-11-19 06:46:32,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:32,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:46:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:32,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:46:32,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:46:32,777 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-11-19 06:46:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:33,497 INFO L93 Difference]: Finished difference Result 433 states and 580 transitions. [2024-11-19 06:46:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:46:33,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 16 [2024-11-19 06:46:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:33,500 INFO L225 Difference]: With dead ends: 433 [2024-11-19 06:46:33,500 INFO L226 Difference]: Without dead ends: 433 [2024-11-19 06:46:33,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 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-11-19 06:46:33,501 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 337 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:33,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 462 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:46:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-19 06:46:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 339. [2024-11-19 06:46:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 296 states have (on average 1.6689189189189189) internal successors, (494), 320 states have internal predecessors, (494), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-19 06:46:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 536 transitions. [2024-11-19 06:46:33,512 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 536 transitions. Word has length 16 [2024-11-19 06:46:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:33,512 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 536 transitions. [2024-11-19 06:46:33,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-11-19 06:46:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 536 transitions. [2024-11-19 06:46:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:46:33,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:33,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:33,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 06:46:33,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:33,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:33,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1438689731, now seen corresponding path program 1 times [2024-11-19 06:46:33,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:33,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323195558] [2024-11-19 06:46:33,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:33,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:33,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:33,718 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:33,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:46:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:33,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:46:33,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:33,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:33,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:33,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323195558] [2024-11-19 06:46:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323195558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:33,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:33,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:46:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612434745] [2024-11-19 06:46:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:33,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:46:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:46:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:33,805 INFO L87 Difference]: Start difference. First operand 339 states and 536 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-11-19 06:46:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:33,835 INFO L93 Difference]: Finished difference Result 482 states and 760 transitions. [2024-11-19 06:46:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:46:33,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 18 [2024-11-19 06:46:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:33,838 INFO L225 Difference]: With dead ends: 482 [2024-11-19 06:46:33,839 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 06:46:33,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:33,840 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 55 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:33,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 115 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 06:46:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 466. [2024-11-19 06:46:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 414 states have (on average 1.6570048309178744) internal successors, (686), 440 states have internal predecessors, (686), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2024-11-19 06:46:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 758 transitions. [2024-11-19 06:46:33,856 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 758 transitions. Word has length 18 [2024-11-19 06:46:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:33,856 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 758 transitions. [2024-11-19 06:46:33,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-11-19 06:46:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 758 transitions. [2024-11-19 06:46:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:46:33,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:33,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:33,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 06:46:34,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:34,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:34,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1438689987, now seen corresponding path program 1 times [2024-11-19 06:46:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:34,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771064704] [2024-11-19 06:46:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:34,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:34,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:34,063 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:34,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:46:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:34,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:46:34,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:34,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:34,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:34,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771064704] [2024-11-19 06:46:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771064704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:46:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884034812] [2024-11-19 06:46:34,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:34,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:46:34,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:34,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:46:34,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:34,184 INFO L87 Difference]: Start difference. First operand 466 states and 758 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-11-19 06:46:34,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:34,235 INFO L93 Difference]: Finished difference Result 508 states and 788 transitions. [2024-11-19 06:46:34,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:46:34,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 18 [2024-11-19 06:46:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:34,238 INFO L225 Difference]: With dead ends: 508 [2024-11-19 06:46:34,238 INFO L226 Difference]: Without dead ends: 508 [2024-11-19 06:46:34,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:34,239 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:34,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 117 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-19 06:46:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 493. [2024-11-19 06:46:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 439 states have (on average 1.6378132118451025) internal successors, (719), 466 states have internal predecessors, (719), 15 states have call successors, (15), 11 states have call predecessors, (15), 16 states have return successors, (51), 15 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-19 06:46:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 785 transitions. [2024-11-19 06:46:34,254 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 785 transitions. Word has length 18 [2024-11-19 06:46:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:34,255 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 785 transitions. [2024-11-19 06:46:34,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-11-19 06:46:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 785 transitions. [2024-11-19 06:46:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:46:34,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:34,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:34,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:34,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:34,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:34,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1649708773, now seen corresponding path program 1 times [2024-11-19 06:46:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:34,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985291563] [2024-11-19 06:46:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:34,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:34,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:34,459 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:34,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:46:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:34,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:46:34,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:34,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:34,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985291563] [2024-11-19 06:46:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985291563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:34,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:34,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:46:34,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671335068] [2024-11-19 06:46:34,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:34,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:46:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:34,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:46:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:34,592 INFO L87 Difference]: Start difference. First operand 493 states and 785 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-11-19 06:46:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:34,643 INFO L93 Difference]: Finished difference Result 508 states and 785 transitions. [2024-11-19 06:46:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:46:34,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 19 [2024-11-19 06:46:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:34,647 INFO L225 Difference]: With dead ends: 508 [2024-11-19 06:46:34,647 INFO L226 Difference]: Without dead ends: 508 [2024-11-19 06:46:34,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:34,648 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:34,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 118 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-19 06:46:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 493. [2024-11-19 06:46:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 439 states have (on average 1.6287015945330297) internal successors, (715), 466 states have internal predecessors, (715), 15 states have call successors, (15), 11 states have call predecessors, (15), 16 states have return successors, (51), 15 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-19 06:46:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 781 transitions. [2024-11-19 06:46:34,662 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 781 transitions. Word has length 19 [2024-11-19 06:46:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:34,662 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 781 transitions. [2024-11-19 06:46:34,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-11-19 06:46:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 781 transitions. [2024-11-19 06:46:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:46:34,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:34,663 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 06:46:34,668 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 (13)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:34,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:34,864 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:34,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:34,865 INFO L85 PathProgramCache]: Analyzing trace with hash 437828489, now seen corresponding path program 2 times [2024-11-19 06:46:34,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:34,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177934372] [2024-11-19 06:46:34,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:46:34,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:34,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:34,866 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:34,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:46:34,924 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:46:34,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:46:34,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:46:34,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:35,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:35,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:35,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177934372] [2024-11-19 06:46:35,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177934372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:35,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:35,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-11-19 06:46:35,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031563546] [2024-11-19 06:46:35,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:35,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:46:35,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:35,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:46:35,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:46:35,616 INFO L87 Difference]: Start difference. First operand 493 states and 781 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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-11-19 06:46:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:36,450 INFO L93 Difference]: Finished difference Result 595 states and 923 transitions. [2024-11-19 06:46:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:46:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 22 [2024-11-19 06:46:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:36,453 INFO L225 Difference]: With dead ends: 595 [2024-11-19 06:46:36,454 INFO L226 Difference]: Without dead ends: 595 [2024-11-19 06:46:36,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:46:36,456 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 192 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:36,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 334 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:46:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-19 06:46:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 546. [2024-11-19 06:46:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 492 states have (on average 1.6483739837398375) internal successors, (811), 519 states have internal predecessors, (811), 15 states have call successors, (15), 11 states have call predecessors, (15), 16 states have return successors, (51), 15 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-19 06:46:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 877 transitions. [2024-11-19 06:46:36,476 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 877 transitions. Word has length 22 [2024-11-19 06:46:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:36,476 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 877 transitions. [2024-11-19 06:46:36,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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-11-19 06:46:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 877 transitions. [2024-11-19 06:46:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:46:36,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:36,479 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-11-19 06:46:36,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 06:46:36,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:36,680 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:36,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1948313302, now seen corresponding path program 1 times [2024-11-19 06:46:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783614653] [2024-11-19 06:46:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:36,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:36,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:36,684 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:36,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:46:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:36,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:46:36,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:36,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:36,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:36,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783614653] [2024-11-19 06:46:36,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783614653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:36,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:36,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:36,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723984692] [2024-11-19 06:46:36,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:36,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:46:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:36,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:46:36,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:36,759 INFO L87 Difference]: Start difference. First operand 546 states and 877 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-11-19 06:46:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:36,767 INFO L93 Difference]: Finished difference Result 396 states and 616 transitions. [2024-11-19 06:46:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:46:36,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11-19 06:46:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:36,770 INFO L225 Difference]: With dead ends: 396 [2024-11-19 06:46:36,770 INFO L226 Difference]: Without dead ends: 396 [2024-11-19 06:46:36,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:36,770 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 9 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:36,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-19 06:46:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-19 06:46:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 351 states have (on average 1.6353276353276354) internal successors, (574), 376 states have internal predecessors, (574), 11 states have call successors, (11), 8 states have call predecessors, (11), 11 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-19 06:46:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 616 transitions. [2024-11-19 06:46:36,783 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 616 transitions. Word has length 25 [2024-11-19 06:46:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:36,784 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 616 transitions. [2024-11-19 06:46:36,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11-19 06:46:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 616 transitions. [2024-11-19 06:46:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:46:36,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:36,786 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, 1] [2024-11-19 06:46:36,791 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 (15)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:36,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:36,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:36,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1793598830, now seen corresponding path program 1 times [2024-11-19 06:46:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472542549] [2024-11-19 06:46:36,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:36,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:36,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:36,992 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:36,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:46:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:37,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:46:37,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:37,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:37,418 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-11-19 06:46:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:37,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:41,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:41,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472542549] [2024-11-19 06:46:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472542549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:41,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [42889953] [2024-11-19 06:46:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:41,758 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:46:41,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:46:41,761 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-11-19 06:46:41,769 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-11-19 06:46:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:41,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:46:41,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:42,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:42,273 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-11-19 06:46:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:42,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:42,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [42889953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:42,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:42,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-19 06:46:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14375651] [2024-11-19 06:46:42,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:42,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:46:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:42,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:46:42,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2024-11-19 06:46:42,526 INFO L87 Difference]: Start difference. First operand 396 states and 616 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-19 06:46:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:43,085 INFO L93 Difference]: Finished difference Result 430 states and 612 transitions. [2024-11-19 06:46:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:46:43,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-19 06:46:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:43,088 INFO L225 Difference]: With dead ends: 430 [2024-11-19 06:46:43,088 INFO L226 Difference]: Without dead ends: 430 [2024-11-19 06:46:43,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=111, Invalid=230, Unknown=1, NotChecked=0, Total=342 [2024-11-19 06:46:43,089 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 152 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:43,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 139 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:46:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-19 06:46:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 420. [2024-11-19 06:46:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 369 states have (on average 1.4986449864498645) internal successors, (553), 398 states have internal predecessors, (553), 12 states have call successors, (12), 9 states have call predecessors, (12), 18 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) [2024-11-19 06:46:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 607 transitions. [2024-11-19 06:46:43,105 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 607 transitions. Word has length 27 [2024-11-19 06:46:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:43,115 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 607 transitions. [2024-11-19 06:46:43,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-19 06:46:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 607 transitions. [2024-11-19 06:46:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:46:43,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:43,116 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, 1, 1] [2024-11-19 06:46:43,123 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-11-19 06:46:43,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:43,517 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-11-19 06:46:43,517 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:43,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1075966913, now seen corresponding path program 1 times [2024-11-19 06:46:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:43,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642827371] [2024-11-19 06:46:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:43,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:43,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:43,520 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:43,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 06:46:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:43,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:46:43,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:43,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:43,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:43,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642827371] [2024-11-19 06:46:43,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642827371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:43,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:43,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:46:43,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491632883] [2024-11-19 06:46:43,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:43,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:46:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:46:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:43,737 INFO L87 Difference]: Start difference. First operand 420 states and 607 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-19 06:46:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:43,846 INFO L93 Difference]: Finished difference Result 443 states and 626 transitions. [2024-11-19 06:46:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:46:43,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 28 [2024-11-19 06:46:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:43,848 INFO L225 Difference]: With dead ends: 443 [2024-11-19 06:46:43,848 INFO L226 Difference]: Without dead ends: 443 [2024-11-19 06:46:43,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:43,849 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:43,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 213 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-19 06:46:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 433. [2024-11-19 06:46:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 382 states have (on average 1.4816753926701571) internal successors, (566), 411 states have internal predecessors, (566), 12 states have call successors, (12), 9 states have call predecessors, (12), 18 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) [2024-11-19 06:46:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 620 transitions. [2024-11-19 06:46:43,862 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 620 transitions. Word has length 28 [2024-11-19 06:46:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:43,862 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 620 transitions. [2024-11-19 06:46:43,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-19 06:46:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 620 transitions. [2024-11-19 06:46:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:46:43,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:43,864 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, 1, 1] [2024-11-19 06:46:43,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 06:46:44,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:44,065 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:46:44,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1366588429, now seen corresponding path program 1 times [2024-11-19 06:46:44,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:44,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719540367] [2024-11-19 06:46:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:44,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:44,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:44,068 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:44,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 06:46:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:44,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:46:44,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:44,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:44,559 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-11-19 06:46:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:44,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:48,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719540367] [2024-11-19 06:46:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719540367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [906981299] [2024-11-19 06:46:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:48,959 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:46:48,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:46:48,961 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-11-19 06:46:48,962 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-11-19 06:46:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:49,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 06:46:49,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:49,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:49,638 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-11-19 06:46:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:49,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [906981299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:53,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2024-11-19 06:46:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16535934] [2024-11-19 06:46:53,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:53,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:46:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:46:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2024-11-19 06:46:53,942 INFO L87 Difference]: Start difference. First operand 433 states and 620 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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)