./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:48:04,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:48:04,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:48:04,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:48:04,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:48:04,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:48:04,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:48:04,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:48:04,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:48:04,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:48:04,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:48:04,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:48:04,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:48:04,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:48:04,299 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:48:04,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:48:04,301 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:48:04,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:48:04,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:48:04,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:48:04,302 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:48:04,303 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:48:04,304 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:48:04,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:48:04,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:48:04,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:48:04,305 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:48:04,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:48:04,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:48:04,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:48:04,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:48:04,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:48:04,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:48:04,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:04,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:48:04,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:48:04,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:48:04,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:48:04,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:48:04,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:48:04,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:48:04,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:48:04,311 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2024-11-09 07:48:04,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:48:04,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:48:04,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:48:04,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:48:04,624 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:48:04,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-11-09 07:48:06,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:48:06,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:48:06,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-11-09 07:48:06,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a162578e7/eeff9486a67c4f15a8bb55b99f6d0604/FLAG836affeff [2024-11-09 07:48:06,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a162578e7/eeff9486a67c4f15a8bb55b99f6d0604 [2024-11-09 07:48:06,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:48:06,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:48:06,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:06,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:48:06,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:48:06,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5841126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06, skipping insertion in model container [2024-11-09 07:48:06,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:48:06,747 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-09 07:48:06,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:06,767 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:48:06,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:06,860 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:48:06,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06 WrapperNode [2024-11-09 07:48:06,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:06,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:06,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:48:06,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:48:06,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,922 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2024-11-09 07:48:06,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:06,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:48:06,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:48:06,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:48:06,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,958 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-09 07:48:06,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:48:06,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:48:06,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:48:06,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:48:06,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (1/1) ... [2024-11-09 07:48:06,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:07,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:07,033 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-09 07:48:07,037 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-09 07:48:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:48:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:48:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:48:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-09 07:48:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-09 07:48:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:48:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:48:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:48:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:48:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:48:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:48:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:48:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:48:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:48:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:48:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:48:07,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:48:07,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:48:07,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:48:07,245 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:48:07,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:48:07,509 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-09 07:48:07,509 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:48:07,522 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:48:07,523 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:48:07,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:07 BoogieIcfgContainer [2024-11-09 07:48:07,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:48:07,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:48:07,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:48:07,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:48:07,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:48:06" (1/3) ... [2024-11-09 07:48:07,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c12b5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:07, skipping insertion in model container [2024-11-09 07:48:07,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:06" (2/3) ... [2024-11-09 07:48:07,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c12b5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:07, skipping insertion in model container [2024-11-09 07:48:07,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:07" (3/3) ... [2024-11-09 07:48:07,534 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2024-11-09 07:48:07,551 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:48:07,552 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-09 07:48:07,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:48:07,607 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;@13485991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:48:07,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-09 07:48:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 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-09 07:48:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:48:07,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:07,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:48:07,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:07,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash -742866944, now seen corresponding path program 1 times [2024-11-09 07:48:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:07,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787054771] [2024-11-09 07:48:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:08,001 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-09 07:48:08,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:08,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787054771] [2024-11-09 07:48:08,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787054771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:08,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:08,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:48:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707015562] [2024-11-09 07:48:08,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:08,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:08,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:08,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:08,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:08,032 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 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-09 07:48:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:08,180 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2024-11-09 07:48:08,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:08,183 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-09 07:48:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:08,190 INFO L225 Difference]: With dead ends: 123 [2024-11-09 07:48:08,190 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 07:48:08,192 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-09 07:48:08,194 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 105 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:08,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 119 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 07:48:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2024-11-09 07:48:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.619047619047619) internal successors, (102), 80 states have internal predecessors, (102), 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-09 07:48:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2024-11-09 07:48:08,252 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 6 [2024-11-09 07:48:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:08,253 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2024-11-09 07:48:08,253 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-09 07:48:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2024-11-09 07:48:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:48:08,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:08,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:48:08,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:48:08,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:08,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:08,256 INFO L85 PathProgramCache]: Analyzing trace with hash -742866943, now seen corresponding path program 1 times [2024-11-09 07:48:08,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:08,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243184650] [2024-11-09 07:48:08,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243184650] [2024-11-09 07:48:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243184650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:08,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:08,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596216656] [2024-11-09 07:48:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:08,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:08,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:08,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:08,476 INFO L87 Difference]: Start difference. First operand 90 states and 120 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-09 07:48:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:08,629 INFO L93 Difference]: Finished difference Result 191 states and 255 transitions. [2024-11-09 07:48:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:08,630 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-09 07:48:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:08,632 INFO L225 Difference]: With dead ends: 191 [2024-11-09 07:48:08,632 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 07:48:08,632 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-09 07:48:08,636 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 89 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 200 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-09 07:48:08,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 200 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 07:48:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 165. [2024-11-09 07:48:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 131 states have (on average 1.6412213740458015) internal successors, (215), 148 states have internal predecessors, (215), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 07:48:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2024-11-09 07:48:08,670 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 6 [2024-11-09 07:48:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:08,671 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2024-11-09 07:48:08,671 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-09 07:48:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2024-11-09 07:48:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:48:08,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:08,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:08,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:48:08,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:08,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1554038803, now seen corresponding path program 1 times [2024-11-09 07:48:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:08,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789711870] [2024-11-09 07:48:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:08,934 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-09 07:48:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:08,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789711870] [2024-11-09 07:48:08,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789711870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:08,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44131587] [2024-11-09 07:48:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:08,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:08,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:08,937 INFO L87 Difference]: Start difference. First operand 165 states and 251 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-09 07:48:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:09,112 INFO L93 Difference]: Finished difference Result 210 states and 300 transitions. [2024-11-09 07:48:09,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:09,114 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-09 07:48:09,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:09,116 INFO L225 Difference]: With dead ends: 210 [2024-11-09 07:48:09,116 INFO L226 Difference]: Without dead ends: 210 [2024-11-09 07:48:09,116 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-09 07:48:09,120 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 67 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:09,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 170 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-09 07:48:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2024-11-09 07:48:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.626865671641791) internal successors, (218), 151 states have internal predecessors, (218), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 07:48:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2024-11-09 07:48:09,149 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 7 [2024-11-09 07:48:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:09,149 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2024-11-09 07:48:09,149 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-09 07:48:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2024-11-09 07:48:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:48:09,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:09,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:09,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:48:09,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:09,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash -930562592, now seen corresponding path program 1 times [2024-11-09 07:48:09,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:09,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188494267] [2024-11-09 07:48:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:09,334 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-09 07:48:09,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:09,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188494267] [2024-11-09 07:48:09,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188494267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:09,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:09,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:09,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868056269] [2024-11-09 07:48:09,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:09,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:09,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:09,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:09,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:09,336 INFO L87 Difference]: Start difference. First operand 168 states and 254 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-09 07:48:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:09,453 INFO L93 Difference]: Finished difference Result 193 states and 256 transitions. [2024-11-09 07:48:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:09,454 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-09 07:48:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:09,455 INFO L225 Difference]: With dead ends: 193 [2024-11-09 07:48:09,455 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 07:48:09,456 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-09 07:48:09,457 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 70 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 195 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-09 07:48:09,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 195 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 07:48:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 168. [2024-11-09 07:48:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.6119402985074627) internal successors, (216), 151 states have internal predecessors, (216), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 07:48:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2024-11-09 07:48:09,479 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 8 [2024-11-09 07:48:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:09,479 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2024-11-09 07:48:09,479 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-09 07:48:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2024-11-09 07:48:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:48:09,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:09,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:09,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:48:09,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:09,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1217330767, now seen corresponding path program 1 times [2024-11-09 07:48:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374521604] [2024-11-09 07:48:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:09,568 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-09 07:48:09,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:09,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374521604] [2024-11-09 07:48:09,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374521604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:09,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:09,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:09,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771594051] [2024-11-09 07:48:09,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:09,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:09,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:09,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:09,575 INFO L87 Difference]: Start difference. First operand 168 states and 252 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-09 07:48:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:09,726 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2024-11-09 07:48:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:09,727 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-09 07:48:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:09,728 INFO L225 Difference]: With dead ends: 251 [2024-11-09 07:48:09,728 INFO L226 Difference]: Without dead ends: 251 [2024-11-09 07:48:09,729 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-09 07:48:09,730 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 133 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:09,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 188 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-09 07:48:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 202. [2024-11-09 07:48:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 166 states have (on average 1.5843373493975903) internal successors, (263), 184 states have internal predecessors, (263), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 07:48:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2024-11-09 07:48:09,741 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 9 [2024-11-09 07:48:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:09,742 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2024-11-09 07:48:09,742 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-09 07:48:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2024-11-09 07:48:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:48:09,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:09,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:09,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:48:09,743 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:09,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash -917451838, now seen corresponding path program 1 times [2024-11-09 07:48:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:09,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519357306] [2024-11-09 07:48:09,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:09,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:09,828 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-09 07:48:09,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:09,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519357306] [2024-11-09 07:48:09,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519357306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:09,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:09,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879762761] [2024-11-09 07:48:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:09,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:09,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:09,831 INFO L87 Difference]: Start difference. First operand 202 states and 299 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-09 07:48:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:09,920 INFO L93 Difference]: Finished difference Result 250 states and 322 transitions. [2024-11-09 07:48:09,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:09,920 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-09 07:48:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:09,922 INFO L225 Difference]: With dead ends: 250 [2024-11-09 07:48:09,922 INFO L226 Difference]: Without dead ends: 250 [2024-11-09 07:48:09,922 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-09 07:48:09,923 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 187 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 201 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-09 07:48:09,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 201 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-09 07:48:09,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 216. [2024-11-09 07:48:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 179 states have (on average 1.5865921787709498) internal successors, (284), 198 states have internal predecessors, (284), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 07:48:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2024-11-09 07:48:09,932 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 10 [2024-11-09 07:48:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:09,932 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2024-11-09 07:48:09,932 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-09 07:48:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2024-11-09 07:48:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:48:09,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:09,933 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:09,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:48:09,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:09,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash -657083128, now seen corresponding path program 1 times [2024-11-09 07:48:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:09,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786586526] [2024-11-09 07:48:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:09,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:10,108 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-09 07:48:10,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786586526] [2024-11-09 07:48:10,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786586526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282070235] [2024-11-09 07:48:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:10,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:10,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:10,112 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-09 07:48:10,114 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-09 07:48:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:10,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:48:10,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:10,398 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-09 07:48:10,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:10,528 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-09 07:48:10,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282070235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:10,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:10,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-11-09 07:48:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709174091] [2024-11-09 07:48:10,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:10,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:48:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:10,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:48:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:48:10,531 INFO L87 Difference]: Start difference. First operand 216 states and 320 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-09 07:48:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:10,744 INFO L93 Difference]: Finished difference Result 242 states and 319 transitions. [2024-11-09 07:48:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:48:10,745 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-09 07:48:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:10,746 INFO L225 Difference]: With dead ends: 242 [2024-11-09 07:48:10,746 INFO L226 Difference]: Without dead ends: 242 [2024-11-09 07:48:10,747 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-09 07:48:10,747 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 198 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:10,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 374 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-09 07:48:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 219. [2024-11-09 07:48:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 182 states have (on average 1.5274725274725274) internal successors, (278), 201 states have internal predecessors, (278), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 07:48:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 314 transitions. [2024-11-09 07:48:10,760 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 314 transitions. Word has length 14 [2024-11-09 07:48:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:10,760 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 314 transitions. [2024-11-09 07:48:10,761 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-09 07:48:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 314 transitions. [2024-11-09 07:48:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:48:10,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:10,762 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:10,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:10,965 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-09 07:48:10,966 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:10,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1105259462, now seen corresponding path program 1 times [2024-11-09 07:48:10,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:10,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387517213] [2024-11-09 07:48:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:11,126 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-09 07:48:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387517213] [2024-11-09 07:48:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387517213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202978731] [2024-11-09 07:48:11,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:11,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:11,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:11,130 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-09 07:48:11,132 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-09 07:48:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:11,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:48:11,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:11,368 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-09 07:48:11,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:11,440 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-09 07:48:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202978731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:11,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:11,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2024-11-09 07:48:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49409419] [2024-11-09 07:48:11,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:11,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:48:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:11,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:48:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:48:11,443 INFO L87 Difference]: Start difference. First operand 219 states and 314 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-09 07:48:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:11,713 INFO L93 Difference]: Finished difference Result 262 states and 359 transitions. [2024-11-09 07:48:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:48:11,714 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-09 07:48:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:11,715 INFO L225 Difference]: With dead ends: 262 [2024-11-09 07:48:11,715 INFO L226 Difference]: Without dead ends: 262 [2024-11-09 07:48:11,716 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-09 07:48:11,716 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 116 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:11,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 353 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:11,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-09 07:48:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 227. [2024-11-09 07:48:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 190 states have (on average 1.5210526315789474) internal successors, (289), 209 states have internal predecessors, (289), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 07:48:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 325 transitions. [2024-11-09 07:48:11,724 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 325 transitions. Word has length 15 [2024-11-09 07:48:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:11,724 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 325 transitions. [2024-11-09 07:48:11,725 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-09 07:48:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 325 transitions. [2024-11-09 07:48:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:48:11,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:11,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:11,743 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-09 07:48:11,926 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-09 07:48:11,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:11,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -96695001, now seen corresponding path program 1 times [2024-11-09 07:48:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536461495] [2024-11-09 07:48:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:11,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,116 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-09 07:48:12,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536461495] [2024-11-09 07:48:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536461495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016561706] [2024-11-09 07:48:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:12,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:12,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:12,120 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-09 07:48:12,122 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-09 07:48:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:12,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:48:12,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:12,412 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-09 07:48:12,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:12,552 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-09 07:48:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016561706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:12,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:12,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-09 07:48:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180232141] [2024-11-09 07:48:12,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:12,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:48:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:48:12,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:48:12,555 INFO L87 Difference]: Start difference. First operand 227 states and 325 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-09 07:48:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:13,070 INFO L93 Difference]: Finished difference Result 362 states and 478 transitions. [2024-11-09 07:48:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:48:13,070 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-09 07:48:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:13,072 INFO L225 Difference]: With dead ends: 362 [2024-11-09 07:48:13,072 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 07:48:13,073 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-09 07:48:13,073 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 305 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:13,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 623 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 07:48:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 299. [2024-11-09 07:48:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 258 states have (on average 1.5426356589147288) internal successors, (398), 279 states have internal predecessors, (398), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-09 07:48:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 441 transitions. [2024-11-09 07:48:13,087 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 441 transitions. Word has length 16 [2024-11-09 07:48:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:13,087 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 441 transitions. [2024-11-09 07:48:13,088 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-09 07:48:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 441 transitions. [2024-11-09 07:48:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:48:13,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:13,089 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-09 07:48:13,105 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-09 07:48:13,289 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-09 07:48:13,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:13,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496567, now seen corresponding path program 1 times [2024-11-09 07:48:13,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:13,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131257051] [2024-11-09 07:48:13,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:13,332 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-09 07:48:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131257051] [2024-11-09 07:48:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131257051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:13,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:48:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35787867] [2024-11-09 07:48:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:13,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:13,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:13,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:13,334 INFO L87 Difference]: Start difference. First operand 299 states and 441 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-09 07:48:13,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:13,354 INFO L93 Difference]: Finished difference Result 438 states and 652 transitions. [2024-11-09 07:48:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:13,355 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-09 07:48:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:13,357 INFO L225 Difference]: With dead ends: 438 [2024-11-09 07:48:13,357 INFO L226 Difference]: Without dead ends: 438 [2024-11-09 07:48:13,357 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-09 07:48:13,358 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:13,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 105 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-09 07:48:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 421. [2024-11-09 07:48:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 371 states have (on average 1.5498652291105122) internal successors, (575), 394 states have internal predecessors, (575), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2024-11-09 07:48:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 644 transitions. [2024-11-09 07:48:13,371 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 644 transitions. Word has length 18 [2024-11-09 07:48:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:13,371 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 644 transitions. [2024-11-09 07:48:13,371 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-09 07:48:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 644 transitions. [2024-11-09 07:48:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:48:13,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:13,372 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-09 07:48:13,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:48:13,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:13,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:13,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496311, now seen corresponding path program 1 times [2024-11-09 07:48:13,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:13,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172112151] [2024-11-09 07:48:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:13,401 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-09 07:48:13,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:13,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172112151] [2024-11-09 07:48:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172112151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302183357] [2024-11-09 07:48:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:13,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:13,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:13,403 INFO L87 Difference]: Start difference. First operand 421 states and 644 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-09 07:48:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:13,414 INFO L93 Difference]: Finished difference Result 383 states and 578 transitions. [2024-11-09 07:48:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:13,415 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-09 07:48:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:13,417 INFO L225 Difference]: With dead ends: 383 [2024-11-09 07:48:13,417 INFO L226 Difference]: Without dead ends: 383 [2024-11-09 07:48:13,420 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-09 07:48:13,421 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 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-09 07:48:13,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-09 07:48:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-11-09 07:48:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 339 states have (on average 1.5014749262536873) internal successors, (509), 356 states have internal predecessors, (509), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2024-11-09 07:48:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 578 transitions. [2024-11-09 07:48:13,439 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 578 transitions. Word has length 18 [2024-11-09 07:48:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:13,439 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 578 transitions. [2024-11-09 07:48:13,440 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-09 07:48:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 578 transitions. [2024-11-09 07:48:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:48:13,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:13,441 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-09 07:48:13,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:48:13,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:13,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash 284148639, now seen corresponding path program 1 times [2024-11-09 07:48:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:13,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194436749] [2024-11-09 07:48:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:13,492 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-09 07:48:13,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:13,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194436749] [2024-11-09 07:48:13,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194436749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:13,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:13,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:48:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253601107] [2024-11-09 07:48:13,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:13,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:13,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:13,494 INFO L87 Difference]: Start difference. First operand 383 states and 578 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-09 07:48:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:13,519 INFO L93 Difference]: Finished difference Result 450 states and 659 transitions. [2024-11-09 07:48:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:13,520 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-09 07:48:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:13,522 INFO L225 Difference]: With dead ends: 450 [2024-11-09 07:48:13,522 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 07:48:13,522 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-09 07:48:13,523 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:13,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 89 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 07:48:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 433. [2024-11-09 07:48:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 385 states have (on average 1.4961038961038962) internal successors, (576), 404 states have internal predecessors, (576), 16 states have call successors, (16), 12 states have call predecessors, (16), 20 states have return successors, (57), 16 states have call predecessors, (57), 16 states have call successors, (57) [2024-11-09 07:48:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 649 transitions. [2024-11-09 07:48:13,534 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 649 transitions. Word has length 19 [2024-11-09 07:48:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:13,535 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 649 transitions. [2024-11-09 07:48:13,535 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-09 07:48:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 649 transitions. [2024-11-09 07:48:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:48:13,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:13,536 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-09 07:48:13,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:48:13,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:13,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash 373919402, now seen corresponding path program 1 times [2024-11-09 07:48:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:13,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240606886] [2024-11-09 07:48:13,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:13,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:13,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:13,617 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-09 07:48:13,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:13,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240606886] [2024-11-09 07:48:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240606886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:13,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:13,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:48:13,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542519011] [2024-11-09 07:48:13,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:13,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:13,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:13,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:13,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:13,622 INFO L87 Difference]: Start difference. First operand 433 states and 649 transitions. Second operand has 4 states, 4 states have (on average 5.5) 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-09 07:48:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:13,685 INFO L93 Difference]: Finished difference Result 308 states and 435 transitions. [2024-11-09 07:48:13,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:13,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) 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-09 07:48:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:13,687 INFO L225 Difference]: With dead ends: 308 [2024-11-09 07:48:13,687 INFO L226 Difference]: Without dead ends: 308 [2024-11-09 07:48:13,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:13,687 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:13,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-09 07:48:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2024-11-09 07:48:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 264 states have (on average 1.4621212121212122) internal successors, (386), 282 states have internal predecessors, (386), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-09 07:48:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 429 transitions. [2024-11-09 07:48:13,697 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 429 transitions. Word has length 25 [2024-11-09 07:48:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:13,697 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 429 transitions. [2024-11-09 07:48:13,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) 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-09 07:48:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 429 transitions. [2024-11-09 07:48:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:48:13,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:13,699 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-09 07:48:13,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:48:13,699 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:13,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash 463540592, now seen corresponding path program 1 times [2024-11-09 07:48:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028415248] [2024-11-09 07:48:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:13,828 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-09 07:48:13,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:13,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028415248] [2024-11-09 07:48:13,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028415248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:13,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:13,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:48:13,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136807633] [2024-11-09 07:48:13,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:13,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:48:13,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:13,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:48:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:13,830 INFO L87 Difference]: Start difference. First operand 302 states and 429 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 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-09 07:48:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:13,988 INFO L93 Difference]: Finished difference Result 321 states and 443 transitions. [2024-11-09 07:48:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:48:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 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-09 07:48:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:13,990 INFO L225 Difference]: With dead ends: 321 [2024-11-09 07:48:13,990 INFO L226 Difference]: Without dead ends: 321 [2024-11-09 07:48:13,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:48:13,991 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 106 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:13,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 130 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-09 07:48:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 302. [2024-11-09 07:48:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 264 states have (on average 1.4507575757575757) internal successors, (383), 282 states have internal predecessors, (383), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-09 07:48:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 426 transitions. [2024-11-09 07:48:14,000 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 426 transitions. Word has length 27 [2024-11-09 07:48:14,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:14,001 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 426 transitions. [2024-11-09 07:48:14,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 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-09 07:48:14,001 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 426 transitions. [2024-11-09 07:48:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:48:14,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:14,002 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-09 07:48:14,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:48:14,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:14,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash 70513582, now seen corresponding path program 1 times [2024-11-09 07:48:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:14,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263809703] [2024-11-09 07:48:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:14,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:14,290 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-09 07:48:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:14,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263809703] [2024-11-09 07:48:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263809703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:14,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604356277] [2024-11-09 07:48:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:14,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:14,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:14,293 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-09 07:48:14,295 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-09 07:48:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:14,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 07:48:14,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:14,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:14,634 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-09 07:48:14,697 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-09 07:48:14,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604356277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:14,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:14,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2024-11-09 07:48:14,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275230384] [2024-11-09 07:48:14,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:14,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:48:14,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:14,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:48:14,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:48:14,852 INFO L87 Difference]: Start difference. First operand 302 states and 426 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) 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-09 07:48:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:15,289 INFO L93 Difference]: Finished difference Result 318 states and 427 transitions. [2024-11-09 07:48:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:48:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) 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-09 07:48:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:15,291 INFO L225 Difference]: With dead ends: 318 [2024-11-09 07:48:15,291 INFO L226 Difference]: Without dead ends: 318 [2024-11-09 07:48:15,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:48:15,292 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:15,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 87 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-09 07:48:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 306. [2024-11-09 07:48:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 268 states have (on average 1.4067164179104477) internal successors, (377), 286 states have internal predecessors, (377), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-09 07:48:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 420 transitions. [2024-11-09 07:48:15,300 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 420 transitions. Word has length 27 [2024-11-09 07:48:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:15,300 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 420 transitions. [2024-11-09 07:48:15,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) 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-09 07:48:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 420 transitions. [2024-11-09 07:48:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:48:15,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:15,301 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-09 07:48:15,319 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-09 07:48:15,502 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-09 07:48:15,502 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:15,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash -263999033, now seen corresponding path program 1 times [2024-11-09 07:48:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320893294] [2024-11-09 07:48:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:15,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:15,673 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-09 07:48:15,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:15,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320893294] [2024-11-09 07:48:15,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320893294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:15,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498967508] [2024-11-09 07:48:15,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:15,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:15,676 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-09 07:48:15,678 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-09 07:48:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:15,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:48:15,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:15,877 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-09 07:48:15,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:15,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498967508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:15,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:48:15,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2024-11-09 07:48:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805618342] [2024-11-09 07:48:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:15,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:48:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:15,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:48:15,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:48:15,878 INFO L87 Difference]: Start difference. First operand 306 states and 420 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-09 07:48:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:15,941 INFO L93 Difference]: Finished difference Result 327 states and 437 transitions. [2024-11-09 07:48:15,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:48:15,942 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-09 07:48:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:15,944 INFO L225 Difference]: With dead ends: 327 [2024-11-09 07:48:15,944 INFO L226 Difference]: Without dead ends: 327 [2024-11-09 07:48:15,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:48:15,944 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 137 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-09 07:48:15,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 137 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-09 07:48:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2024-11-09 07:48:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 279 states have (on average 1.3906810035842294) internal successors, (388), 297 states have internal predecessors, (388), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-09 07:48:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2024-11-09 07:48:15,953 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 28 [2024-11-09 07:48:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:15,953 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2024-11-09 07:48:15,953 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-09 07:48:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2024-11-09 07:48:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:48:15,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:15,954 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-09 07:48:15,972 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-09 07:48:16,158 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-09 07:48:16,159 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:16,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash -955925939, now seen corresponding path program 1 times [2024-11-09 07:48:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:16,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490254581] [2024-11-09 07:48:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:16,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:16,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490254581] [2024-11-09 07:48:16,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490254581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:16,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372506445] [2024-11-09 07:48:16,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:16,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:16,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:16,700 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-09 07:48:16,701 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-09 07:48:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:16,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:48:16,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:17,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:17,096 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-09 07:48:17,216 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-09 07:48:17,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:17,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372506445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:17,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:17,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2024-11-09 07:48:17,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429533460] [2024-11-09 07:48:17,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:17,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:48:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:17,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:48:17,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:48:17,360 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) 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-09 07:48:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:17,885 INFO L93 Difference]: Finished difference Result 326 states and 431 transitions. [2024-11-09 07:48:17,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:48:17,886 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) 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-09 07:48:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:17,887 INFO L225 Difference]: With dead ends: 326 [2024-11-09 07:48:17,887 INFO L226 Difference]: Without dead ends: 326 [2024-11-09 07:48:17,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:48:17,889 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 329 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:17,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 126 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-09 07:48:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 318. [2024-11-09 07:48:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 280 states have (on average 1.3714285714285714) internal successors, (384), 298 states have internal predecessors, (384), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-09 07:48:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 427 transitions. [2024-11-09 07:48:17,897 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 427 transitions. Word has length 29 [2024-11-09 07:48:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:17,897 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 427 transitions. [2024-11-09 07:48:17,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) 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-09 07:48:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 427 transitions. [2024-11-09 07:48:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:48:17,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:17,898 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-09 07:48:17,916 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-09 07:48:18,102 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-09 07:48:18,103 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:18,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash 431067010, now seen corresponding path program 1 times [2024-11-09 07:48:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:18,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327198078] [2024-11-09 07:48:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:18,286 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-09 07:48:18,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327198078] [2024-11-09 07:48:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327198078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:18,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578756922] [2024-11-09 07:48:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:18,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:18,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:18,289 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-09 07:48:18,290 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-09 07:48:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:18,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:48:18,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:18,449 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:18,449 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-09 07:48:18,499 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-09 07:48:18,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578756922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:18,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:18,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-11-09 07:48:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652973795] [2024-11-09 07:48:18,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:18,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:48:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:18,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:48:18,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:48:18,547 INFO L87 Difference]: Start difference. First operand 318 states and 427 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 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-09 07:48:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:19,007 INFO L93 Difference]: Finished difference Result 436 states and 544 transitions. [2024-11-09 07:48:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:48:19,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 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-09 07:48:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:19,009 INFO L225 Difference]: With dead ends: 436 [2024-11-09 07:48:19,010 INFO L226 Difference]: Without dead ends: 436 [2024-11-09 07:48:19,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:48:19,010 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 348 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:19,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 170 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-09 07:48:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 395. [2024-11-09 07:48:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 354 states have (on average 1.3389830508474576) internal successors, (474), 373 states have internal predecessors, (474), 11 states have call successors, (11), 10 states have call predecessors, (11), 18 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 07:48:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 516 transitions. [2024-11-09 07:48:19,022 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 516 transitions. Word has length 30 [2024-11-09 07:48:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:19,023 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 516 transitions. [2024-11-09 07:48:19,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 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-09 07:48:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 516 transitions. [2024-11-09 07:48:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:48:19,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:19,024 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-09 07:48:19,041 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-09 07:48:19,224 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-09 07:48:19,225 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:19,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash 478175471, now seen corresponding path program 1 times [2024-11-09 07:48:19,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:19,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750959926] [2024-11-09 07:48:19,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:19,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:19,468 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-09 07:48:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:19,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750959926] [2024-11-09 07:48:19,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750959926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:19,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385765101] [2024-11-09 07:48:19,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:19,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:19,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:19,472 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-09 07:48:19,473 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-09 07:48:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:19,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:48:19,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:19,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:19,671 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-09 07:48:19,752 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-09 07:48:19,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:19,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385765101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:19,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:19,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2024-11-09 07:48:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288299015] [2024-11-09 07:48:19,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:19,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:48:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:19,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:48:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:48:19,857 INFO L87 Difference]: Start difference. First operand 395 states and 516 transitions. Second operand has 16 states, 13 states have (on average 4.3076923076923075) 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-09 07:48:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:20,394 INFO L93 Difference]: Finished difference Result 529 states and 643 transitions. [2024-11-09 07:48:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:48:20,395 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.3076923076923075) 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-09 07:48:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:20,397 INFO L225 Difference]: With dead ends: 529 [2024-11-09 07:48:20,397 INFO L226 Difference]: Without dead ends: 529 [2024-11-09 07:48:20,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:48:20,398 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 350 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:20,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 227 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-09 07:48:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 485. [2024-11-09 07:48:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 441 states have (on average 1.3174603174603174) internal successors, (581), 462 states have internal predecessors, (581), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2024-11-09 07:48:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 619 transitions. [2024-11-09 07:48:20,410 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 619 transitions. Word has length 31 [2024-11-09 07:48:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:20,411 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 619 transitions. [2024-11-09 07:48:20,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.3076923076923075) 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-09 07:48:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 619 transitions. [2024-11-09 07:48:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:48:20,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:20,412 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-09 07:48:20,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:20,612 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-09 07:48:20,612 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:20,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash 850193333, now seen corresponding path program 1 times [2024-11-09 07:48:20,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:20,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312308670] [2024-11-09 07:48:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:20,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:20,877 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-09 07:48:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312308670] [2024-11-09 07:48:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312308670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268066885] [2024-11-09 07:48:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:20,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:20,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:20,880 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-09 07:48:20,882 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-09 07:48:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:20,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:48:20,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:21,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:21,177 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-09 07:48:21,296 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-09 07:48:21,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268066885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:21,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2024-11-09 07:48:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538047657] [2024-11-09 07:48:21,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:21,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:48:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:48:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:48:21,457 INFO L87 Difference]: Start difference. First operand 485 states and 619 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) 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-09 07:48:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:21,926 INFO L93 Difference]: Finished difference Result 499 states and 612 transitions. [2024-11-09 07:48:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:48:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) 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-09 07:48:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:21,929 INFO L225 Difference]: With dead ends: 499 [2024-11-09 07:48:21,929 INFO L226 Difference]: Without dead ends: 499 [2024-11-09 07:48:21,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:48:21,930 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 422 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:21,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 127 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-09 07:48:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 482. [2024-11-09 07:48:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 441 states have (on average 1.2698412698412698) internal successors, (560), 459 states have internal predecessors, (560), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2024-11-09 07:48:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 598 transitions. [2024-11-09 07:48:21,939 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 598 transitions. Word has length 35 [2024-11-09 07:48:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 598 transitions. [2024-11-09 07:48:21,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) 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-09 07:48:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 598 transitions. [2024-11-09 07:48:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:48:21,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:21,940 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-09 07:48:21,958 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-09 07:48:22,141 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-09 07:48:22,141 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:22,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2003179406, now seen corresponding path program 1 times [2024-11-09 07:48:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116317220] [2024-11-09 07:48:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:22,308 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-09 07:48:22,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:22,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116317220] [2024-11-09 07:48:22,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116317220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:22,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575088038] [2024-11-09 07:48:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:22,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:22,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:22,311 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-09 07:48:22,312 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-09 07:48:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:22,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:48:22,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:22,550 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:22,550 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-09 07:48:22,628 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-09 07:48:22,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:22,656 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-09 07:48:22,823 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-09 07:48:22,847 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-09 07:48:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575088038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:22,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:22,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2024-11-09 07:48:22,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105960468] [2024-11-09 07:48:22,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:22,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:48:22,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:22,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:48:22,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:48:22,849 INFO L87 Difference]: Start difference. First operand 482 states and 598 transitions. Second operand has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 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-09 07:48:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:23,191 INFO L93 Difference]: Finished difference Result 521 states and 624 transitions. [2024-11-09 07:48:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:48:23,191 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 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-09 07:48:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:23,192 INFO L225 Difference]: With dead ends: 521 [2024-11-09 07:48:23,192 INFO L226 Difference]: Without dead ends: 521 [2024-11-09 07:48:23,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:48:23,194 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 324 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:23,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 155 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-09 07:48:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 485. [2024-11-09 07:48:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 444 states have (on average 1.268018018018018) internal successors, (563), 462 states have internal predecessors, (563), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2024-11-09 07:48:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 600 transitions. [2024-11-09 07:48:23,203 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 600 transitions. Word has length 36 [2024-11-09 07:48:23,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:23,204 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 600 transitions. [2024-11-09 07:48:23,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 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-09 07:48:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 600 transitions. [2024-11-09 07:48:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:48:23,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:23,205 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-09 07:48:23,222 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-09 07:48:23,405 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-09 07:48:23,405 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:23,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:23,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1969019423, now seen corresponding path program 1 times [2024-11-09 07:48:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:23,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642676881] [2024-11-09 07:48:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:23,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:23,933 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-09 07:48:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642676881] [2024-11-09 07:48:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642676881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:23,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207045148] [2024-11-09 07:48:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:23,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:23,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:23,936 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-09 07:48:23,937 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-09 07:48:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:24,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:48:24,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:24,356 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-09 07:48:24,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:24,616 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-09 07:48:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207045148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:24,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:24,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2024-11-09 07:48:24,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523634010] [2024-11-09 07:48:24,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:24,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:48:24,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:24,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:48:24,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:48:24,619 INFO L87 Difference]: Start difference. First operand 485 states and 600 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-09 07:48:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:26,036 INFO L93 Difference]: Finished difference Result 693 states and 827 transitions. [2024-11-09 07:48:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 07:48:26,039 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-09 07:48:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:26,041 INFO L225 Difference]: With dead ends: 693 [2024-11-09 07:48:26,041 INFO L226 Difference]: Without dead ends: 693 [2024-11-09 07:48:26,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=553, Invalid=2527, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 07:48:26,042 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 899 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:26,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 330 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:48:26,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-09 07:48:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 488. [2024-11-09 07:48:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 449 states have (on average 1.2583518930957684) internal successors, (565), 467 states have internal predecessors, (565), 10 states have call successors, (10), 10 states have call predecessors, (10), 20 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2024-11-09 07:48:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 599 transitions. [2024-11-09 07:48:26,053 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 599 transitions. Word has length 37 [2024-11-09 07:48:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:26,053 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 599 transitions. [2024-11-09 07:48:26,053 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-09 07:48:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 599 transitions. [2024-11-09 07:48:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:48:26,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:26,054 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-09 07:48:26,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 07:48:26,258 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-09 07:48:26,259 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:26,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:26,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1392814043, now seen corresponding path program 1 times [2024-11-09 07:48:26,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:26,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800364720] [2024-11-09 07:48:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:26,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:26,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:26,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800364720] [2024-11-09 07:48:26,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800364720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:26,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986074533] [2024-11-09 07:48:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:26,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:26,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:26,344 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-09 07:48:26,346 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-09 07:48:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:26,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:48:26,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:26,460 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-09 07:48:26,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986074533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:26,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:48:26,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-09 07:48:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440469490] [2024-11-09 07:48:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:26,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:26,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:26,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:48:26,462 INFO L87 Difference]: Start difference. First operand 488 states and 599 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-09 07:48:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:26,484 INFO L93 Difference]: Finished difference Result 292 states and 341 transitions. [2024-11-09 07:48:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:26,485 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-09 07:48:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:26,486 INFO L225 Difference]: With dead ends: 292 [2024-11-09 07:48:26,486 INFO L226 Difference]: Without dead ends: 292 [2024-11-09 07:48:26,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:48:26,488 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 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-09 07:48:26,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-09 07:48:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-09 07:48:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 260 states have (on average 1.226923076923077) internal successors, (319), 273 states have internal predecessors, (319), 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-09 07:48:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 339 transitions. [2024-11-09 07:48:26,493 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 339 transitions. Word has length 45 [2024-11-09 07:48:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:26,494 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 339 transitions. [2024-11-09 07:48:26,494 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-09 07:48:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 339 transitions. [2024-11-09 07:48:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:48:26,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:26,495 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:26,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 07:48:26,696 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-09 07:48:26,696 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash -736414851, now seen corresponding path program 1 times [2024-11-09 07:48:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:26,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36015380] [2024-11-09 07:48:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:48:26,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:26,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36015380] [2024-11-09 07:48:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36015380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:26,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570197553] [2024-11-09 07:48:26,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:26,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:26,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:26,795 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-09 07:48:26,797 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-09 07:48:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:26,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:48:26,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:48:26,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570197553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:26,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:48:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-09 07:48:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209889200] [2024-11-09 07:48:26,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:26,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:26,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:26,922 INFO L87 Difference]: Start difference. First operand 288 states and 339 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-09 07:48:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:26,939 INFO L93 Difference]: Finished difference Result 287 states and 336 transitions. [2024-11-09 07:48:26,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:26,941 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 47 [2024-11-09 07:48:26,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:26,942 INFO L225 Difference]: With dead ends: 287 [2024-11-09 07:48:26,943 INFO L226 Difference]: Without dead ends: 287 [2024-11-09 07:48:26,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:26,944 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:26,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 82 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-09 07:48:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-09 07:48:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 260 states have (on average 1.2153846153846153) internal successors, (316), 272 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-09 07:48:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 336 transitions. [2024-11-09 07:48:26,954 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 336 transitions. Word has length 47 [2024-11-09 07:48:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:26,954 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 336 transitions. [2024-11-09 07:48:26,955 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-09 07:48:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 336 transitions. [2024-11-09 07:48:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:48:26,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:26,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:26,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:27,160 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-09 07:48:27,161 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:27,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:27,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1354023829, now seen corresponding path program 1 times [2024-11-09 07:48:27,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:27,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330132150] [2024-11-09 07:48:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:48:27,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:27,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330132150] [2024-11-09 07:48:27,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330132150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:27,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143642693] [2024-11-09 07:48:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:27,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:27,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:27,257 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-09 07:48:27,260 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-09 07:48:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:27,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:48:27,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:48:27,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143642693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:27,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:48:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-09 07:48:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906864348] [2024-11-09 07:48:27,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:27,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:27,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:27,391 INFO L87 Difference]: Start difference. First operand 287 states and 336 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-09 07:48:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:27,419 INFO L93 Difference]: Finished difference Result 286 states and 332 transitions. [2024-11-09 07:48:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:27,420 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 48 [2024-11-09 07:48:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:27,421 INFO L225 Difference]: With dead ends: 286 [2024-11-09 07:48:27,421 INFO L226 Difference]: Without dead ends: 286 [2024-11-09 07:48:27,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:27,422 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:27,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-09 07:48:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-11-09 07:48:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 260 states have (on average 1.2) internal successors, (312), 271 states have internal predecessors, (312), 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-09 07:48:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 332 transitions. [2024-11-09 07:48:27,435 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 332 transitions. Word has length 48 [2024-11-09 07:48:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:27,435 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 332 transitions. [2024-11-09 07:48:27,436 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-09 07:48:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 332 transitions. [2024-11-09 07:48:27,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:48:27,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:27,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:27,453 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-09 07:48:27,637 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-09 07:48:27,638 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:27,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:27,638 INFO L85 PathProgramCache]: Analyzing trace with hash 974934335, now seen corresponding path program 1 times [2024-11-09 07:48:27,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:27,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8425244] [2024-11-09 07:48:27,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:27,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:27,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:48:27,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:27,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8425244] [2024-11-09 07:48:27,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8425244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:27,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569599462] [2024-11-09 07:48:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:27,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:27,773 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-09 07:48:27,775 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-09 07:48:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:27,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:48:27,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:27,865 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-09 07:48:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:48:27,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:27,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569599462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:27,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:48:27,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-09 07:48:27,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122647832] [2024-11-09 07:48:27,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:27,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:27,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:27,909 INFO L87 Difference]: Start difference. First operand 286 states and 332 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-09 07:48:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:27,968 INFO L93 Difference]: Finished difference Result 300 states and 340 transitions. [2024-11-09 07:48:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:27,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 49 [2024-11-09 07:48:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:27,970 INFO L225 Difference]: With dead ends: 300 [2024-11-09 07:48:27,971 INFO L226 Difference]: Without dead ends: 300 [2024-11-09 07:48:27,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:27,971 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:27,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 111 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-09 07:48:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 286. [2024-11-09 07:48:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 260 states have (on average 1.1884615384615385) internal successors, (309), 271 states have internal predecessors, (309), 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-09 07:48:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2024-11-09 07:48:27,978 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 49 [2024-11-09 07:48:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:27,978 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2024-11-09 07:48:27,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-09 07:48:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2024-11-09 07:48:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:48:27,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:27,979 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] [2024-11-09 07:48:27,997 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-09 07:48:28,183 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-09 07:48:28,184 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1716482195, now seen corresponding path program 1 times [2024-11-09 07:48:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:28,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440107924] [2024-11-09 07:48:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:28,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 07:48:28,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440107924] [2024-11-09 07:48:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440107924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:28,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539153404] [2024-11-09 07:48:28,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:28,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:28,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:28,412 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-09 07:48:28,413 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-09 07:48:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:28,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 07:48:28,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:28,578 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:28,578 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-09 07:48:28,642 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:28,642 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-09 07:48:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 07:48:28,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539153404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:28,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-11-09 07:48:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73900601] [2024-11-09 07:48:28,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:28,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:48:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:48:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:48:28,731 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 07:48:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:29,141 INFO L93 Difference]: Finished difference Result 302 states and 339 transitions. [2024-11-09 07:48:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:48:29,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2024-11-09 07:48:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:29,143 INFO L225 Difference]: With dead ends: 302 [2024-11-09 07:48:29,143 INFO L226 Difference]: Without dead ends: 302 [2024-11-09 07:48:29,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:48:29,143 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 219 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:29,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 171 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-09 07:48:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 286. [2024-11-09 07:48:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 260 states have (on average 1.176923076923077) internal successors, (306), 271 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-09 07:48:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 326 transitions. [2024-11-09 07:48:29,148 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 326 transitions. Word has length 51 [2024-11-09 07:48:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:29,149 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 326 transitions. [2024-11-09 07:48:29,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 07:48:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 326 transitions. [2024-11-09 07:48:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:48:29,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:29,150 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:29,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 07:48:29,350 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-09 07:48:29,351 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:29,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:29,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1671340444, now seen corresponding path program 1 times [2024-11-09 07:48:29,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:29,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58924823] [2024-11-09 07:48:29,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:29,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:29,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:29,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:29,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58924823] [2024-11-09 07:48:29,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58924823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:29,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887677187] [2024-11-09 07:48:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:29,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:29,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:29,736 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-09 07:48:29,738 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-09 07:48:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:29,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:48:29,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:29,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:29,972 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-09 07:48:29,986 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:29,986 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-09 07:48:30,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:30,086 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-09 07:48:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 07:48:30,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887677187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:30,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2024-11-09 07:48:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108389092] [2024-11-09 07:48:30,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:30,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:48:30,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:30,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:48:30,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:48:30,282 INFO L87 Difference]: Start difference. First operand 286 states and 326 transitions. Second operand has 21 states, 17 states have (on average 4.823529411764706) internal successors, (82), 14 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:48:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:30,763 INFO L93 Difference]: Finished difference Result 300 states and 331 transitions. [2024-11-09 07:48:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:48:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.823529411764706) internal successors, (82), 14 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2024-11-09 07:48:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:30,765 INFO L225 Difference]: With dead ends: 300 [2024-11-09 07:48:30,765 INFO L226 Difference]: Without dead ends: 300 [2024-11-09 07:48:30,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=963, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 07:48:30,766 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 388 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:30,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 198 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-09 07:48:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 285. [2024-11-09 07:48:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 260 states have (on average 1.146153846153846) internal successors, (298), 270 states have internal predecessors, (298), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 07:48:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 318 transitions. [2024-11-09 07:48:30,773 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 318 transitions. Word has length 52 [2024-11-09 07:48:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:30,773 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 318 transitions. [2024-11-09 07:48:30,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.823529411764706) internal successors, (82), 14 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:48:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 318 transitions. [2024-11-09 07:48:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 07:48:30,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:30,774 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:30,788 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-09 07:48:30,974 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-09 07:48:30,975 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:30,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:30,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1609725499, now seen corresponding path program 1 times [2024-11-09 07:48:30,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:30,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672517478] [2024-11-09 07:48:30,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:30,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:31,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:48:31,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:31,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672517478] [2024-11-09 07:48:31,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672517478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:31,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650066154] [2024-11-09 07:48:31,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:31,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:31,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:31,169 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-09 07:48:31,170 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-09 07:48:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:31,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:48:31,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:31,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:48:31,375 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-09 07:48:31,535 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:31,535 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-09 07:48:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:48:31,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:31,610 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-09 07:48:31,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 07:48:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:48:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650066154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:31,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:31,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2024-11-09 07:48:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349333668] [2024-11-09 07:48:31,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:31,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:48:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:31,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:48:31,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:48:31,901 INFO L87 Difference]: Start difference. First operand 285 states and 318 transitions. Second operand has 23 states, 21 states have (on average 6.571428571428571) internal successors, (138), 21 states have internal predecessors, (138), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:48:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:32,141 INFO L93 Difference]: Finished difference Result 295 states and 328 transitions. [2024-11-09 07:48:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:48:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.571428571428571) internal successors, (138), 21 states have internal predecessors, (138), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 57 [2024-11-09 07:48:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:32,143 INFO L225 Difference]: With dead ends: 295 [2024-11-09 07:48:32,143 INFO L226 Difference]: Without dead ends: 295 [2024-11-09 07:48:32,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:48:32,144 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 200 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:32,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 70 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-09 07:48:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 284. [2024-11-09 07:48:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.1423076923076922) internal successors, (297), 269 states have internal predecessors, (297), 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-09 07:48:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 317 transitions. [2024-11-09 07:48:32,149 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 317 transitions. Word has length 57 [2024-11-09 07:48:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:32,149 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 317 transitions. [2024-11-09 07:48:32,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.571428571428571) internal successors, (138), 21 states have internal predecessors, (138), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:48:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 317 transitions. [2024-11-09 07:48:32,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 07:48:32,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:32,150 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:32,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 07:48:32,351 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-09 07:48:32,351 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:32,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1638117102, now seen corresponding path program 1 times [2024-11-09 07:48:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:32,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447792603] [2024-11-09 07:48:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:32,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:32,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:48:32,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:32,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447792603] [2024-11-09 07:48:32,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447792603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:32,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322376683] [2024-11-09 07:48:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:32,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:32,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:32,915 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-09 07:48:32,918 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-09 07:48:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:33,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 07:48:33,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:33,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:48:33,206 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-09 07:48:33,489 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:33,489 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-09 07:48:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:48:33,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:33,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-09 07:48:33,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:48:33,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-09 07:48:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:48:34,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322376683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:34,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 39 [2024-11-09 07:48:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191023742] [2024-11-09 07:48:34,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:34,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 07:48:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 07:48:34,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1467, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:48:34,102 INFO L87 Difference]: Start difference. First operand 284 states and 317 transitions. Second operand has 41 states, 37 states have (on average 3.945945945945946) internal successors, (146), 32 states have internal predecessors, (146), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:48:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:34,648 INFO L93 Difference]: Finished difference Result 295 states and 327 transitions. [2024-11-09 07:48:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:48:34,649 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 3.945945945945946) internal successors, (146), 32 states have internal predecessors, (146), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2024-11-09 07:48:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:34,650 INFO L225 Difference]: With dead ends: 295 [2024-11-09 07:48:34,650 INFO L226 Difference]: Without dead ends: 295 [2024-11-09 07:48:34,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=366, Invalid=1986, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 07:48:34,652 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 253 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:34,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 267 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-09 07:48:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 284. [2024-11-09 07:48:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.1384615384615384) internal successors, (296), 269 states have internal predecessors, (296), 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-09 07:48:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 316 transitions. [2024-11-09 07:48:34,658 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 316 transitions. Word has length 58 [2024-11-09 07:48:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:34,658 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 316 transitions. [2024-11-09 07:48:34,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 3.945945945945946) internal successors, (146), 32 states have internal predecessors, (146), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:48:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 316 transitions. [2024-11-09 07:48:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 07:48:34,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:34,659 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] [2024-11-09 07:48:34,678 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-09 07:48:34,863 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-09 07:48:34,863 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:34,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash 147398217, now seen corresponding path program 1 times [2024-11-09 07:48:34,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:34,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430291935] [2024-11-09 07:48:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:48:35,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:35,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430291935] [2024-11-09 07:48:35,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430291935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:35,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526239685] [2024-11-09 07:48:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:35,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:35,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:35,441 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-09 07:48:35,442 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-09 07:48:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:35,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:48:35,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:35,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:35,794 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-09 07:48:36,007 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:36,007 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-09 07:48:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:36,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:36,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526239685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:36,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:36,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 24 [2024-11-09 07:48:36,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75025891] [2024-11-09 07:48:36,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:36,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:48:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:36,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:48:36,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2024-11-09 07:48:36,403 INFO L87 Difference]: Start difference. First operand 284 states and 316 transitions. Second operand has 26 states, 23 states have (on average 4.608695652173913) internal successors, (106), 20 states have internal predecessors, (106), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:37,271 INFO L93 Difference]: Finished difference Result 307 states and 338 transitions. [2024-11-09 07:48:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:48:37,271 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.608695652173913) internal successors, (106), 20 states have internal predecessors, (106), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2024-11-09 07:48:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:37,273 INFO L225 Difference]: With dead ends: 307 [2024-11-09 07:48:37,273 INFO L226 Difference]: Without dead ends: 307 [2024-11-09 07:48:37,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=462, Invalid=1794, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 07:48:37,274 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 449 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:37,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 211 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-09 07:48:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 243. [2024-11-09 07:48:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 224 states have (on average 1.1339285714285714) internal successors, (254), 230 states have internal predecessors, (254), 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-09 07:48:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 269 transitions. [2024-11-09 07:48:37,282 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 269 transitions. Word has length 58 [2024-11-09 07:48:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:37,282 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 269 transitions. [2024-11-09 07:48:37,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.608695652173913) internal successors, (106), 20 states have internal predecessors, (106), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:48:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 269 transitions. [2024-11-09 07:48:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 07:48:37,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:37,283 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:37,303 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-09 07:48:37,487 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-09 07:48:37,488 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:37,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2022464052, now seen corresponding path program 1 times [2024-11-09 07:48:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:37,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185304428] [2024-11-09 07:48:37,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:37,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:48:37,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:37,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185304428] [2024-11-09 07:48:37,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185304428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:37,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809539911] [2024-11-09 07:48:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:37,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:37,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:37,808 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-09 07:48:37,810 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-09 07:48:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:37,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:48:37,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:37,966 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:48:37,966 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-09 07:48:38,061 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-09 07:48:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:48:38,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:38,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809539911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:38,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:38,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-09 07:48:38,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356470842] [2024-11-09 07:48:38,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:38,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:48:38,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:38,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:48:38,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:48:38,374 INFO L87 Difference]: Start difference. First operand 243 states and 269 transitions. Second operand has 18 states, 16 states have (on average 5.3125) internal successors, (85), 13 states have internal predecessors, (85), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:48:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:38,671 INFO L93 Difference]: Finished difference Result 256 states and 282 transitions. [2024-11-09 07:48:38,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:48:38,672 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.3125) internal successors, (85), 13 states have internal predecessors, (85), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-09 07:48:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:38,673 INFO L225 Difference]: With dead ends: 256 [2024-11-09 07:48:38,673 INFO L226 Difference]: Without dead ends: 256 [2024-11-09 07:48:38,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2024-11-09 07:48:38,674 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 195 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:38,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 175 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-09 07:48:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2024-11-09 07:48:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 224 states have (on average 1.1294642857142858) internal successors, (253), 229 states have internal predecessors, (253), 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-09 07:48:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2024-11-09 07:48:38,678 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 60 [2024-11-09 07:48:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:38,678 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2024-11-09 07:48:38,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.3125) internal successors, (85), 13 states have internal predecessors, (85), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:48:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2024-11-09 07:48:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 07:48:38,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:38,679 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:38,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-09 07:48:38,879 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-09 07:48:38,880 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:38,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:38,882 INFO L85 PathProgramCache]: Analyzing trace with hash -383711253, now seen corresponding path program 2 times [2024-11-09 07:48:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:38,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858435826] [2024-11-09 07:48:38,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:38,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:39,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:48:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:39,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:48:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:48:39,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:48:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858435826] [2024-11-09 07:48:39,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858435826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123233722] [2024-11-09 07:48:39,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:48:39,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:48:39,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:39,242 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-09 07:48:39,243 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-09 07:48:39,336 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:48:39,337 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:48:39,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 07:48:39,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:39,505 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:48:39,505 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-09 07:48:39,758 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:48:39,758 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-09 07:48:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:39,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:40,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-09 07:48:40,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:48:40,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-11-09 07:48:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123233722] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:40,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:48:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 42 [2024-11-09 07:48:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412052928] [2024-11-09 07:48:40,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 07:48:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:48:40,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 07:48:40,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 07:48:40,530 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand has 44 states, 40 states have (on average 4.4) internal successors, (176), 36 states have internal predecessors, (176), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:48:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:41,122 INFO L93 Difference]: Finished difference Result 255 states and 281 transitions. [2024-11-09 07:48:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:48:41,123 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 4.4) internal successors, (176), 36 states have internal predecessors, (176), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2024-11-09 07:48:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:41,124 INFO L225 Difference]: With dead ends: 255 [2024-11-09 07:48:41,124 INFO L226 Difference]: Without dead ends: 255 [2024-11-09 07:48:41,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=463, Invalid=2399, Unknown=0, NotChecked=0, Total=2862 [2024-11-09 07:48:41,125 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 415 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:41,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 208 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-09 07:48:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2024-11-09 07:48:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 224 states have (on average 1.125) internal successors, (252), 228 states have internal predecessors, (252), 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-09 07:48:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 267 transitions. [2024-11-09 07:48:41,132 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 267 transitions. Word has length 66 [2024-11-09 07:48:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:41,133 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 267 transitions. [2024-11-09 07:48:41,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 4.4) internal successors, (176), 36 states have internal predecessors, (176), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:48:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 267 transitions. [2024-11-09 07:48:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 07:48:41,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:41,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:41,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-09 07:48:41,337 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-09 07:48:41,338 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:41,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1230760792, now seen corresponding path program 1 times [2024-11-09 07:48:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:48:41,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462979565] [2024-11-09 07:48:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:48:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:48:41,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:48:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:48:41,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:48:41,390 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:48:41,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-09 07:48:41,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-09 07:48:41,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-09 07:48:41,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-09 07:48:41,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-09 07:48:41,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-09 07:48:41,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-09 07:48:41,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-09 07:48:41,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-09 07:48:41,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-09 07:48:41,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-09 07:48:41,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2024-11-09 07:48:41,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2024-11-09 07:48:41,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2024-11-09 07:48:41,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2024-11-09 07:48:41,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2024-11-09 07:48:41,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2024-11-09 07:48:41,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-11-09 07:48:41,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-11-09 07:48:41,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-11-09 07:48:41,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 07:48:41,401 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:41,465 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:48:41,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:48:41 BoogieIcfgContainer [2024-11-09 07:48:41,468 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:48:41,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:48:41,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:48:41,469 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:48:41,469 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:07" (3/4) ... [2024-11-09 07:48:41,474 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:48:41,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:48:41,476 INFO L158 Benchmark]: Toolchain (without parser) took 35182.31ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 112.0MB in the beginning and 136.5MB in the end (delta: -24.5MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2024-11-09 07:48:41,476 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:48:41,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.43ms. Allocated memory is still 155.2MB. Free memory was 112.0MB in the beginning and 89.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 07:48:41,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.05ms. Allocated memory is still 155.2MB. Free memory was 89.3MB in the beginning and 87.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:48:41,477 INFO L158 Benchmark]: Boogie Preprocessor took 59.29ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 84.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:48:41,477 INFO L158 Benchmark]: RCFGBuilder took 541.16ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 109.3MB in the end (delta: -24.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 07:48:41,477 INFO L158 Benchmark]: TraceAbstraction took 33942.05ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 109.3MB in the beginning and 137.5MB in the end (delta: -28.2MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2024-11-09 07:48:41,478 INFO L158 Benchmark]: Witness Printer took 6.95ms. Allocated memory is still 270.5MB. Free memory was 137.5MB in the beginning and 136.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:48:41,482 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.17ms. Allocated memory is still 100.7MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.43ms. Allocated memory is still 155.2MB. Free memory was 112.0MB in the beginning and 89.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.05ms. Allocated memory is still 155.2MB. Free memory was 89.3MB in the beginning and 87.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.29ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 84.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 541.16ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 109.3MB in the end (delta: -24.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 33942.05ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 109.3MB in the beginning and 137.5MB in the end (delta: -28.2MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * Witness Printer took 6.95ms. Allocated memory is still 270.5MB. Free memory was 137.5MB in the beginning and 136.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function 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={-3:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={-3:0}, state=1] [L695] RET commands[i].function() [L722] RET parse_input("c1") VAL [commands={6:0}, global={-3:0}, state=1] [L723] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, input={4:0}, state=1] [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L706] COND TRUE \read(*global) VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, input={5:0}, state=1] [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L706] COND TRUE \read(*global) VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=1, commands={6:0}, global={-6:0}, state=1] [L695] RET commands[i].function() [L724] RET parse_input("c2") VAL [commands={6:0}, global={-6:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={-6:0}, state=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 33.8s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6804 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6804 mSDsluCounter, 5961 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4602 mSDsCounter, 807 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7903 IncrementalHoareTripleChecker+Invalid, 8710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 807 mSolverCounterUnsat, 1359 mSDtfsCounter, 7903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1711 GetRequests, 1130 SyntacticMatches, 2 SemanticMatches, 579 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3805 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=22, InterpolantAutomatonStates: 312, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 919 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1998 NumberOfCodeBlocks, 1998 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 2167 ConstructedInterpolants, 163 QuantifiedInterpolants, 26493 SizeOfPredicates, 83 NumberOfNonLiveVariables, 5543 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 63 InterpolantComputations, 16 PerfectInterpolantSequences, 431/1172 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-09 07:48:41,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:48:43,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:48:43,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:48:43,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:48:43,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:48:43,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:48:43,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:48:43,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:48:43,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:48:43,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:48:43,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:48:43,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:48:43,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:48:43,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:48:43,813 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:48:43,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:48:43,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:48:43,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:48:43,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:48:43,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:48:43,815 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:48:43,816 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:48:43,817 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:48:43,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:48:43,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:48:43,817 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:48:43,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:48:43,818 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:48:43,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:48:43,819 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:48:43,819 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:48:43,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:48:43,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:48:43,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:48:43,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:48:43,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:43,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:48:43,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:48:43,822 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:48:43,822 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:48:43,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:48:43,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:48:43,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:48:43,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:48:43,824 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2024-11-09 07:48:44,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:48:44,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:48:44,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:48:44,195 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:48:44,196 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:48:44,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-11-09 07:48:45,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:48:46,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:48:46,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-11-09 07:48:46,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebdf8a06/43a921e8c0014b9bac0ac4a5ce662a51/FLAGa94794811 [2024-11-09 07:48:46,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebdf8a06/43a921e8c0014b9bac0ac4a5ce662a51 [2024-11-09 07:48:46,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:48:46,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:48:46,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:46,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:48:46,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:48:46,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8a9b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46, skipping insertion in model container [2024-11-09 07:48:46,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:48:46,498 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-09 07:48:46,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:46,525 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:48:46,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:46,622 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:48:46,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46 WrapperNode [2024-11-09 07:48:46,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:46,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:46,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:48:46,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:48:46,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,689 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2024-11-09 07:48:46,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:46,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:48:46,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:48:46,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:48:46,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,732 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-09 07:48:46,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:48:46,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:48:46,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:48:46,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:48:46,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (1/1) ... [2024-11-09 07:48:46,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:46,801 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-09 07:48:46,804 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-09 07:48:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:48:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:48:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 07:48:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-09 07:48:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-09 07:48:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:48:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:48:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:48:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:48:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:48:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:48:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:48:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:48:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:48:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:48:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:48:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 07:48:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:48:46,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:48:46,970 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:48:46,972 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:48:47,266 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-09 07:48:47,267 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:48:47,282 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:48:47,282 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:48:47,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:47 BoogieIcfgContainer [2024-11-09 07:48:47,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:48:47,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:48:47,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:48:47,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:48:47,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:48:46" (1/3) ... [2024-11-09 07:48:47,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba2fb5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:47, skipping insertion in model container [2024-11-09 07:48:47,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46" (2/3) ... [2024-11-09 07:48:47,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba2fb5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:47, skipping insertion in model container [2024-11-09 07:48:47,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:47" (3/3) ... [2024-11-09 07:48:47,291 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2024-11-09 07:48:47,306 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:48:47,307 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-09 07:48:47,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:48:47,352 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;@66a8ab37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:48:47,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-09 07:48:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 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-09 07:48:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:48:47,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:47,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:48:47,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:47,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash -742866944, now seen corresponding path program 1 times [2024-11-09 07:48:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:47,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365943623] [2024-11-09 07:48:47,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:47,391 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-09 07:48:47,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:47,392 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-09 07:48:47,393 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-09 07:48:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:47,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:48:47,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:47,686 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-09 07:48:47,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:47,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:47,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365943623] [2024-11-09 07:48:47,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365943623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:47,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:47,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:48:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381537438] [2024-11-09 07:48:47,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:47,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:47,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:47,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:47,726 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 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-09 07:48:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:47,881 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2024-11-09 07:48:47,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:47,884 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-09 07:48:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:47,892 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:48:47,892 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 07:48:47,893 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-09 07:48:47,896 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:47,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 103 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 07:48:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2024-11-09 07:48:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 76 states have internal predecessors, (96), 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-09 07:48:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2024-11-09 07:48:47,938 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 6 [2024-11-09 07:48:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:47,939 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2024-11-09 07:48:47,939 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-09 07:48:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2024-11-09 07:48:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:48:47,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:47,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:48:47,943 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-09 07:48:48,141 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-09 07:48:48,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:48,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash -742866943, now seen corresponding path program 1 times [2024-11-09 07:48:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:48,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94026605] [2024-11-09 07:48:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:48,143 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-09 07:48:48,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:48,147 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-09 07:48:48,148 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-09 07:48:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:48,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:48:48,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:48,344 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-09 07:48:48,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:48,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:48,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94026605] [2024-11-09 07:48:48,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94026605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:48,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:48,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:48:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157830995] [2024-11-09 07:48:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:48,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:48,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:48,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:48,351 INFO L87 Difference]: Start difference. First operand 84 states and 109 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-09 07:48:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:48,539 INFO L93 Difference]: Finished difference Result 184 states and 240 transitions. [2024-11-09 07:48:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:48,540 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-09 07:48:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:48,542 INFO L225 Difference]: With dead ends: 184 [2024-11-09 07:48:48,544 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 07:48:48,545 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-09 07:48:48,546 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 93 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:48,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 145 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 07:48:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-09 07:48:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.7355371900826446) internal successors, (210), 140 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-09 07:48:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2024-11-09 07:48:48,581 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 236 transitions. Word has length 6 [2024-11-09 07:48:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:48,582 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 236 transitions. [2024-11-09 07:48:48,582 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-09 07:48:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 236 transitions. [2024-11-09 07:48:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:48:48,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:48,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:48,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:48,783 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-09 07:48:48,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:48,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1554038803, now seen corresponding path program 1 times [2024-11-09 07:48:48,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:48,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183766614] [2024-11-09 07:48:48,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:48,786 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-09 07:48:48,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:48,787 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-09 07:48:48,788 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-09 07:48:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:48,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:48:48,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:49,022 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-09 07:48:49,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:49,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:49,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183766614] [2024-11-09 07:48:49,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183766614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:49,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:49,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:49,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736839729] [2024-11-09 07:48:49,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:49,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:49,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:49,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:49,029 INFO L87 Difference]: Start difference. First operand 153 states and 236 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-09 07:48:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:49,296 INFO L93 Difference]: Finished difference Result 198 states and 285 transitions. [2024-11-09 07:48:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:49,297 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-09 07:48:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:49,299 INFO L225 Difference]: With dead ends: 198 [2024-11-09 07:48:49,300 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 07:48:49,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:49,301 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 67 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:49,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 168 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 07:48:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 156. [2024-11-09 07:48:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.717741935483871) internal successors, (213), 143 states have internal predecessors, (213), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-09 07:48:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 239 transitions. [2024-11-09 07:48:49,315 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 239 transitions. Word has length 7 [2024-11-09 07:48:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:49,316 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 239 transitions. [2024-11-09 07:48:49,316 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-09 07:48:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 239 transitions. [2024-11-09 07:48:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:48:49,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:49,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:49,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:49,519 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-09 07:48:49,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:49,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash -930562592, now seen corresponding path program 1 times [2024-11-09 07:48:49,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:49,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141737673] [2024-11-09 07:48:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:49,522 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-09 07:48:49,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:49,525 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-09 07:48:49,526 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-09 07:48:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:49,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:48:49,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:49,735 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-09 07:48:49,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:49,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141737673] [2024-11-09 07:48:49,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141737673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:49,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:49,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170294480] [2024-11-09 07:48:49,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:49,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:49,742 INFO L87 Difference]: Start difference. First operand 156 states and 239 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-09 07:48:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:49,943 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2024-11-09 07:48:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:49,943 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-09 07:48:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:49,945 INFO L225 Difference]: With dead ends: 186 [2024-11-09 07:48:49,945 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 07:48:49,945 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-09 07:48:49,946 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 90 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 192 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-09 07:48:49,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 192 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:48:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 07:48:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 156. [2024-11-09 07:48:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.7016129032258065) internal successors, (211), 143 states have internal predecessors, (211), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-09 07:48:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 237 transitions. [2024-11-09 07:48:49,959 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 237 transitions. Word has length 8 [2024-11-09 07:48:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:49,960 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 237 transitions. [2024-11-09 07:48:49,960 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-09 07:48:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 237 transitions. [2024-11-09 07:48:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:48:49,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:49,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:49,968 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:50,161 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-09 07:48:50,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:50,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1217330767, now seen corresponding path program 1 times [2024-11-09 07:48:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:50,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456079730] [2024-11-09 07:48:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:50,163 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-09 07:48:50,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:50,166 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-09 07:48:50,167 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-09 07:48:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:50,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:48:50,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:50,288 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-09 07:48:50,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:50,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456079730] [2024-11-09 07:48:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456079730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:50,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180734910] [2024-11-09 07:48:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:50,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:50,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:50,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:50,291 INFO L87 Difference]: Start difference. First operand 156 states and 237 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-09 07:48:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:50,421 INFO L93 Difference]: Finished difference Result 239 states and 328 transitions. [2024-11-09 07:48:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:50,422 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-09 07:48:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:50,423 INFO L225 Difference]: With dead ends: 239 [2024-11-09 07:48:50,424 INFO L226 Difference]: Without dead ends: 239 [2024-11-09 07:48:50,425 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-09 07:48:50,425 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 172 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:50,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 171 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-09 07:48:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 190. [2024-11-09 07:48:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 156 states have (on average 1.6538461538461537) internal successors, (258), 176 states have internal predecessors, (258), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-09 07:48:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 284 transitions. [2024-11-09 07:48:50,449 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 284 transitions. Word has length 9 [2024-11-09 07:48:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:50,449 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 284 transitions. [2024-11-09 07:48:50,449 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-09 07:48:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2024-11-09 07:48:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:48:50,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:50,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:50,457 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-09 07:48:50,654 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-09 07:48:50,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:50,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash -917451838, now seen corresponding path program 1 times [2024-11-09 07:48:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:50,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318636482] [2024-11-09 07:48:50,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:50,657 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-09 07:48:50,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:50,660 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-09 07:48:50,661 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-09 07:48:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:50,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:48:50,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:50,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-09 07:48:50,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:50,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318636482] [2024-11-09 07:48:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318636482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:50,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:50,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:50,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550949959] [2024-11-09 07:48:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:50,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:50,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:50,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:50,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:50,810 INFO L87 Difference]: Start difference. First operand 190 states and 284 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-09 07:48:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:50,947 INFO L93 Difference]: Finished difference Result 240 states and 307 transitions. [2024-11-09 07:48:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:50,948 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-09 07:48:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:50,949 INFO L225 Difference]: With dead ends: 240 [2024-11-09 07:48:50,949 INFO L226 Difference]: Without dead ends: 240 [2024-11-09 07:48:50,949 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-09 07:48:50,950 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 183 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 198 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-09 07:48:50,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 198 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-09 07:48:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2024-11-09 07:48:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.650887573964497) internal successors, (279), 190 states have internal predecessors, (279), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-09 07:48:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 305 transitions. [2024-11-09 07:48:50,964 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 305 transitions. Word has length 10 [2024-11-09 07:48:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:50,964 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 305 transitions. [2024-11-09 07:48:50,965 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-09 07:48:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 305 transitions. [2024-11-09 07:48:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:48:50,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:50,965 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:50,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:51,169 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-09 07:48:51,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:51,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -657083128, now seen corresponding path program 1 times [2024-11-09 07:48:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528711110] [2024-11-09 07:48:51,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:51,171 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-09 07:48:51,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:51,174 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-09 07:48:51,175 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-09 07:48:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:51,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:48:51,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:51,389 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-09 07:48:51,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:51,607 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-09 07:48:51,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:51,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528711110] [2024-11-09 07:48:51,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528711110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:51,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:51,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-11-09 07:48:51,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716632955] [2024-11-09 07:48:51,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:51,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:48:51,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:51,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:48:51,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:48:51,610 INFO L87 Difference]: Start difference. First operand 204 states and 305 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-09 07:48:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:51,923 INFO L93 Difference]: Finished difference Result 275 states and 362 transitions. [2024-11-09 07:48:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:48:51,924 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-09 07:48:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:51,925 INFO L225 Difference]: With dead ends: 275 [2024-11-09 07:48:51,925 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 07:48:51,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:48:51,927 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 229 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:51,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 223 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 07:48:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 234. [2024-11-09 07:48:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.64321608040201) internal successors, (327), 220 states have internal predecessors, (327), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-09 07:48:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 353 transitions. [2024-11-09 07:48:51,937 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 353 transitions. Word has length 14 [2024-11-09 07:48:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:51,938 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 353 transitions. [2024-11-09 07:48:51,938 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-09 07:48:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 353 transitions. [2024-11-09 07:48:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:48:51,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:51,939 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:51,945 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-09 07:48:52,139 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-09 07:48:52,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:52,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1105259462, now seen corresponding path program 1 times [2024-11-09 07:48:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:52,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226439944] [2024-11-09 07:48:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:52,141 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-09 07:48:52,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:52,143 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-09 07:48:52,146 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-09 07:48:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:52,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:48:52,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:52,401 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-09 07:48:52,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:52,521 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-09 07:48:52,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226439944] [2024-11-09 07:48:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226439944] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:52,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-09 07:48:52,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52848390] [2024-11-09 07:48:52,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:52,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:48:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:48:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:48:52,524 INFO L87 Difference]: Start difference. First operand 234 states and 353 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-09 07:48:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:52,992 INFO L93 Difference]: Finished difference Result 293 states and 419 transitions. [2024-11-09 07:48:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:48:52,993 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-09 07:48:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:52,995 INFO L225 Difference]: With dead ends: 293 [2024-11-09 07:48:52,995 INFO L226 Difference]: Without dead ends: 293 [2024-11-09 07:48:52,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:48:52,996 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 81 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:52,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 346 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:48:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-09 07:48:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 244. [2024-11-09 07:48:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 209 states have (on average 1.6363636363636365) internal successors, (342), 230 states have internal predecessors, (342), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-09 07:48:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 368 transitions. [2024-11-09 07:48:53,006 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 368 transitions. Word has length 15 [2024-11-09 07:48:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:53,006 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 368 transitions. [2024-11-09 07:48:53,007 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-09 07:48:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 368 transitions. [2024-11-09 07:48:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:48:53,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:53,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:53,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 07:48:53,208 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-09 07:48:53,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:53,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -96695001, now seen corresponding path program 1 times [2024-11-09 07:48:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:53,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677525553] [2024-11-09 07:48:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:53,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:53,212 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-09 07:48:53,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 07:48:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:53,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:48:53,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:53,538 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-09 07:48:53,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:53,673 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-09 07:48:53,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:53,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677525553] [2024-11-09 07:48:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677525553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:53,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:53,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-09 07:48:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082574836] [2024-11-09 07:48:53,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:53,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:48:53,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:53,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:48:53,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:48:53,675 INFO L87 Difference]: Start difference. First operand 244 states and 368 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-09 07:48:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:54,409 INFO L93 Difference]: Finished difference Result 401 states and 529 transitions. [2024-11-09 07:48:54,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:48:54,410 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-09 07:48:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:54,412 INFO L225 Difference]: With dead ends: 401 [2024-11-09 07:48:54,412 INFO L226 Difference]: Without dead ends: 401 [2024-11-09 07:48:54,412 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-09 07:48:54,413 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 250 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:54,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 443 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:48:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-09 07:48:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 313. [2024-11-09 07:48:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 275 states have (on average 1.6472727272727272) internal successors, (453), 297 states have internal predecessors, (453), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-09 07:48:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 485 transitions. [2024-11-09 07:48:54,429 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 485 transitions. Word has length 16 [2024-11-09 07:48:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:54,430 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 485 transitions. [2024-11-09 07:48:54,430 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-09 07:48:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 485 transitions. [2024-11-09 07:48:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:48:54,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:54,431 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-09 07:48:54,437 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-09 07:48:54,634 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-09 07:48:54,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:54,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:54,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496567, now seen corresponding path program 1 times [2024-11-09 07:48:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:54,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656512301] [2024-11-09 07:48:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:54,636 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-09 07:48:54,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:54,639 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-09 07:48:54,640 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-09 07:48:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:54,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:48:54,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:54,727 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-09 07:48:54,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:54,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:54,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656512301] [2024-11-09 07:48:54,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656512301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:54,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:54,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:48:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845473696] [2024-11-09 07:48:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:54,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:54,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:54,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:54,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:54,729 INFO L87 Difference]: Start difference. First operand 313 states and 485 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-09 07:48:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:54,751 INFO L93 Difference]: Finished difference Result 457 states and 705 transitions. [2024-11-09 07:48:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:54,752 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-09 07:48:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:54,754 INFO L225 Difference]: With dead ends: 457 [2024-11-09 07:48:54,754 INFO L226 Difference]: Without dead ends: 457 [2024-11-09 07:48:54,754 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-09 07:48:54,755 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:54,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 109 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-09 07:48:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 437. [2024-11-09 07:48:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 390 states have (on average 1.6435897435897435) internal successors, (641), 414 states have internal predecessors, (641), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (43), 13 states have call predecessors, (43), 13 states have call successors, (43) [2024-11-09 07:48:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 697 transitions. [2024-11-09 07:48:54,773 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 697 transitions. Word has length 18 [2024-11-09 07:48:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:54,774 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 697 transitions. [2024-11-09 07:48:54,774 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-09 07:48:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 697 transitions. [2024-11-09 07:48:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:48:54,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:54,775 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-09 07:48:54,779 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-09 07:48:54,978 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-09 07:48:54,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:54,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496311, now seen corresponding path program 1 times [2024-11-09 07:48:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:54,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295703081] [2024-11-09 07:48:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:54,980 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-09 07:48:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:54,983 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-09 07:48:54,985 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-09 07:48:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:55,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:48:55,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:55,114 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-09 07:48:55,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:55,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:55,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295703081] [2024-11-09 07:48:55,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295703081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:55,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:55,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:48:55,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879742273] [2024-11-09 07:48:55,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:55,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:55,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:55,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:55,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:55,116 INFO L87 Difference]: Start difference. First operand 437 states and 697 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-09 07:48:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:55,150 INFO L93 Difference]: Finished difference Result 485 states and 745 transitions. [2024-11-09 07:48:55,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:55,151 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-09 07:48:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:55,153 INFO L225 Difference]: With dead ends: 485 [2024-11-09 07:48:55,154 INFO L226 Difference]: Without dead ends: 485 [2024-11-09 07:48:55,154 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-09 07:48:55,155 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:55,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-09 07:48:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2024-11-09 07:48:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 419 states have (on average 1.6252983293556087) internal successors, (681), 444 states have internal predecessors, (681), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-11-09 07:48:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 741 transitions. [2024-11-09 07:48:55,170 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 741 transitions. Word has length 18 [2024-11-09 07:48:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:55,170 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 741 transitions. [2024-11-09 07:48:55,170 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-09 07:48:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 741 transitions. [2024-11-09 07:48:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:48:55,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:55,171 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-09 07:48:55,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 07:48:55,371 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-09 07:48:55,372 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:55,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash 284148639, now seen corresponding path program 1 times [2024-11-09 07:48:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839329177] [2024-11-09 07:48:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:55,373 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-09 07:48:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:55,374 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-09 07:48:55,375 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-09 07:48:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:55,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:48:55,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:55,513 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-09 07:48:55,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:55,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:55,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839329177] [2024-11-09 07:48:55,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839329177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:55,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:55,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:48:55,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692277207] [2024-11-09 07:48:55,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:55,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:55,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:55,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:55,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:55,515 INFO L87 Difference]: Start difference. First operand 469 states and 741 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-09 07:48:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:55,555 INFO L93 Difference]: Finished difference Result 484 states and 741 transitions. [2024-11-09 07:48:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:55,556 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-09 07:48:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:55,558 INFO L225 Difference]: With dead ends: 484 [2024-11-09 07:48:55,558 INFO L226 Difference]: Without dead ends: 484 [2024-11-09 07:48:55,559 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-09 07:48:55,559 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:55,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-09 07:48:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 469. [2024-11-09 07:48:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 419 states have (on average 1.6157517899761336) internal successors, (677), 444 states have internal predecessors, (677), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-11-09 07:48:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 737 transitions. [2024-11-09 07:48:55,572 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 737 transitions. Word has length 19 [2024-11-09 07:48:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:55,572 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 737 transitions. [2024-11-09 07:48:55,572 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-09 07:48:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 737 transitions. [2024-11-09 07:48:55,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:48:55,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:55,573 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 07:48:55,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 07:48:55,774 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-09 07:48:55,774 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:55,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1911770353, now seen corresponding path program 2 times [2024-11-09 07:48:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:55,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920503449] [2024-11-09 07:48:55,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:48:55,775 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-09 07:48:55,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:55,778 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-09 07:48:55,779 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-09 07:48:55,837 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:48:55,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:48:55,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:48:55,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:56,062 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-09 07:48:56,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:56,466 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-09 07:48:56,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920503449] [2024-11-09 07:48:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920503449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:56,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:56,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-11-09 07:48:56,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389581710] [2024-11-09 07:48:56,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:56,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:48:56,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:48:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:48:56,468 INFO L87 Difference]: Start difference. First operand 469 states and 737 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-09 07:48:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:57,061 INFO L93 Difference]: Finished difference Result 547 states and 827 transitions. [2024-11-09 07:48:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:48:57,061 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-09 07:48:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:57,064 INFO L225 Difference]: With dead ends: 547 [2024-11-09 07:48:57,064 INFO L226 Difference]: Without dead ends: 547 [2024-11-09 07:48:57,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:48:57,065 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 188 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 303 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:57,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 303 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:48:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-09 07:48:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 500. [2024-11-09 07:48:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 450 states have (on average 1.6155555555555556) internal successors, (727), 475 states have internal predecessors, (727), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-11-09 07:48:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 787 transitions. [2024-11-09 07:48:57,078 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 787 transitions. Word has length 22 [2024-11-09 07:48:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:57,078 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 787 transitions. [2024-11-09 07:48:57,078 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-09 07:48:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 787 transitions. [2024-11-09 07:48:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:48:57,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:57,079 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-09 07:48:57,083 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-09 07:48:57,279 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-09 07:48:57,280 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:57,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash 373919402, now seen corresponding path program 1 times [2024-11-09 07:48:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:57,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747483549] [2024-11-09 07:48:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:57,281 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-09 07:48:57,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:57,282 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-09 07:48:57,283 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-09 07:48:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:57,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:48:57,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:57,353 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-09 07:48:57,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:57,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:57,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747483549] [2024-11-09 07:48:57,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747483549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:57,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:57,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:57,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602622282] [2024-11-09 07:48:57,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:57,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:48:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:57,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:48:57,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:48:57,355 INFO L87 Difference]: Start difference. First operand 500 states and 787 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-09 07:48:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:57,363 INFO L93 Difference]: Finished difference Result 350 states and 526 transitions. [2024-11-09 07:48:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:48:57,363 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-09 07:48:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:57,365 INFO L225 Difference]: With dead ends: 350 [2024-11-09 07:48:57,365 INFO L226 Difference]: Without dead ends: 350 [2024-11-09 07:48:57,365 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-09 07:48:57,366 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 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-09 07:48:57,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-09 07:48:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2024-11-09 07:48:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 308 states have (on average 1.5876623376623376) internal successors, (489), 331 states have internal predecessors, (489), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-09 07:48:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 525 transitions. [2024-11-09 07:48:57,376 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 525 transitions. Word has length 25 [2024-11-09 07:48:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:57,377 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 525 transitions. [2024-11-09 07:48:57,377 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-09 07:48:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 525 transitions. [2024-11-09 07:48:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:48:57,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:57,379 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-09 07:48:57,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 07:48:57,579 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-09 07:48:57,580 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash 70513582, now seen corresponding path program 1 times [2024-11-09 07:48:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741033000] [2024-11-09 07:48:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:57,581 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-09 07:48:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:57,584 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-09 07:48:57,585 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-09 07:48:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:57,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:48:57,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:57,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:57,984 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-09 07:48:58,042 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-09 07:48:58,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:58,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741033000] [2024-11-09 07:48:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741033000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1389232704] [2024-11-09 07:48:58,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:58,304 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:48:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:48:58,307 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-09 07:48:58,308 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-09 07:48:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:58,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:48:58,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:58,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:58,748 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-09 07:48:58,780 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-09 07:48:58,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:58,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1389232704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:58,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:58,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-09 07:48:58,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894599514] [2024-11-09 07:48:58,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:58,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:48:58,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:58,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:48:58,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:48:58,925 INFO L87 Difference]: Start difference. First operand 349 states and 525 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-09 07:48:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:59,361 INFO L93 Difference]: Finished difference Result 375 states and 521 transitions. [2024-11-09 07:48:59,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:48:59,363 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-09 07:48:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:59,364 INFO L225 Difference]: With dead ends: 375 [2024-11-09 07:48:59,364 INFO L226 Difference]: Without dead ends: 375 [2024-11-09 07:48:59,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:48:59,365 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 137 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:59,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 122 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-09 07:48:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2024-11-09 07:48:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 319 states have (on average 1.4764890282131662) internal successors, (471), 343 states have internal predecessors, (471), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-09 07:48:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 514 transitions. [2024-11-09 07:48:59,379 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 514 transitions. Word has length 27 [2024-11-09 07:48:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:59,381 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 514 transitions. [2024-11-09 07:48:59,381 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-09 07:48:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 514 transitions. [2024-11-09 07:48:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:48:59,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:59,382 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-09 07:48:59,387 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-09 07:48:59,586 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-09 07:48:59,782 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-09 07:48:59,783 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:48:59,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash -263999033, now seen corresponding path program 1 times [2024-11-09 07:48:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:59,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882336173] [2024-11-09 07:48:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:59,784 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-09 07:48:59,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:59,785 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-09 07:48:59,786 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-09 07:48:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:59,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:48:59,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:59,993 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-09 07:48:59,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:59,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:59,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882336173] [2024-11-09 07:48:59,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882336173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:59,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:59,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:48:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955854465] [2024-11-09 07:48:59,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:59,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:48:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:48:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:48:59,996 INFO L87 Difference]: Start difference. First operand 363 states and 514 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-09 07:49:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:00,089 INFO L93 Difference]: Finished difference Result 384 states and 531 transitions. [2024-11-09 07:49:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:49:00,091 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-09 07:49:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:00,093 INFO L225 Difference]: With dead ends: 384 [2024-11-09 07:49:00,093 INFO L226 Difference]: Without dead ends: 384 [2024-11-09 07:49:00,093 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-09 07:49:00,094 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 69 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 189 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-09 07:49:00,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:49:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-09 07:49:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2024-11-09 07:49:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 330 states have (on average 1.4606060606060607) internal successors, (482), 354 states have internal predecessors, (482), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-09 07:49:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 525 transitions. [2024-11-09 07:49:00,110 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 525 transitions. Word has length 28 [2024-11-09 07:49:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:00,111 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 525 transitions. [2024-11-09 07:49:00,111 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-09 07:49:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 525 transitions. [2024-11-09 07:49:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:49:00,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:00,113 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-09 07:49:00,118 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-09 07:49:00,314 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-09 07:49:00,314 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:49:00,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -955925939, now seen corresponding path program 1 times [2024-11-09 07:49:00,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:00,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863522365] [2024-11-09 07:49:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:00,315 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-09 07:49:00,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:00,317 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-09 07:49:00,318 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-09 07:49:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:00,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:49:00,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:00,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:00,717 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-09 07:49:00,805 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-09 07:49:00,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:04,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863522365] [2024-11-09 07:49:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863522365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [674016974] [2024-11-09 07:49:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:04,967 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:04,968 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-09 07:49:04,970 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-09 07:49:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:05,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 07:49:05,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:05,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:05,564 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-09 07:49:05,662 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-09 07:49:05,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:09,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [674016974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:09,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:09,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2024-11-09 07:49:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188415926] [2024-11-09 07:49:09,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:09,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:49:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:49:09,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2024-11-09 07:49:09,827 INFO L87 Difference]: Start difference. First operand 374 states and 525 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) [2024-11-09 07:49:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:10,714 INFO L93 Difference]: Finished difference Result 383 states and 525 transitions. [2024-11-09 07:49:10,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:49:10,715 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 29 [2024-11-09 07:49:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:10,716 INFO L225 Difference]: With dead ends: 383 [2024-11-09 07:49:10,717 INFO L226 Difference]: Without dead ends: 383 [2024-11-09 07:49:10,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=143, Invalid=362, Unknown=1, NotChecked=0, Total=506 [2024-11-09 07:49:10,717 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 214 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:10,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 172 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:49:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-09 07:49:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 375. [2024-11-09 07:49:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 331 states have (on average 1.444108761329305) internal successors, (478), 355 states have internal predecessors, (478), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-09 07:49:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 521 transitions. [2024-11-09 07:49:10,727 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 521 transitions. Word has length 29 [2024-11-09 07:49:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:10,727 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 521 transitions. [2024-11-09 07:49:10,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-11-09 07:49:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 521 transitions. [2024-11-09 07:49:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:49:10,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:10,728 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-09 07:49:10,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-09 07:49:10,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 07:49:11,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:11,129 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:49:11,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash 431067010, now seen corresponding path program 1 times [2024-11-09 07:49:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:11,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504920582] [2024-11-09 07:49:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:11,130 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-09 07:49:11,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:11,131 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:11,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-09 07:49:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:11,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:49:11,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:11,242 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (_ bv1 1)))) is different from true [2024-11-09 07:49:11,278 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:49:11,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 07:49:11,336 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-09 07:49:11,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:11,555 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-09 07:49:11,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504920582] [2024-11-09 07:49:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504920582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:49:11,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:11,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2024-11-09 07:49:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485850501] [2024-11-09 07:49:11,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:11,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:49:11,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:11,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:49:11,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2024-11-09 07:49:11,557 INFO L87 Difference]: Start difference. First operand 375 states and 521 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 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-09 07:49:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:12,168 INFO L93 Difference]: Finished difference Result 530 states and 678 transitions. [2024-11-09 07:49:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:49:12,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 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-09 07:49:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:12,171 INFO L225 Difference]: With dead ends: 530 [2024-11-09 07:49:12,171 INFO L226 Difference]: Without dead ends: 530 [2024-11-09 07:49:12,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=252, Unknown=8, NotChecked=36, Total=420 [2024-11-09 07:49:12,172 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 276 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:12,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 290 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 237 Invalid, 0 Unknown, 184 Unchecked, 0.4s Time] [2024-11-09 07:49:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-09 07:49:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 460. [2024-11-09 07:49:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 413 states have (on average 1.397094430992736) internal successors, (577), 438 states have internal predecessors, (577), 11 states have call successors, (11), 10 states have call predecessors, (11), 18 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-09 07:49:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 619 transitions. [2024-11-09 07:49:12,184 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 619 transitions. Word has length 30 [2024-11-09 07:49:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:12,185 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 619 transitions. [2024-11-09 07:49:12,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 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-09 07:49:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 619 transitions. [2024-11-09 07:49:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:49:12,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:12,187 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-09 07:49:12,192 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 (21)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:12,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:12,387 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:49:12,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash 478175471, now seen corresponding path program 1 times [2024-11-09 07:49:12,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:12,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126083915] [2024-11-09 07:49:12,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:12,388 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-09 07:49:12,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:12,390 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:12,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 07:49:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:12,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:49:12,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:12,604 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|)))) is different from true [2024-11-09 07:49:12,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:12,677 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-09 07:49:12,806 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-09 07:49:12,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:12,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:12,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126083915] [2024-11-09 07:49:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126083915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1171912575] [2024-11-09 07:49:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:12,986 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:12,987 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:49:12,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-09 07:49:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:13,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:49:13,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:13,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:13,279 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-09 07:49:13,330 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-09 07:49:13,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:13,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1171912575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:13,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:13,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-09 07:49:13,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364194048] [2024-11-09 07:49:13,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:13,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:49:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:13,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:49:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2024-11-09 07:49:13,457 INFO L87 Difference]: Start difference. First operand 460 states and 619 transitions. Second operand has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-09 07:49:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:13,993 INFO L93 Difference]: Finished difference Result 629 states and 777 transitions. [2024-11-09 07:49:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:49:13,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2024-11-09 07:49:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:13,995 INFO L225 Difference]: With dead ends: 629 [2024-11-09 07:49:13,995 INFO L226 Difference]: Without dead ends: 629 [2024-11-09 07:49:13,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=291, Unknown=1, NotChecked=38, Total=462 [2024-11-09 07:49:13,996 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 380 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:13,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 208 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 162 Invalid, 0 Unknown, 232 Unchecked, 0.3s Time] [2024-11-09 07:49:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-09 07:49:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 556. [2024-11-09 07:49:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 506 states have (on average 1.3715415019762847) internal successors, (694), 533 states have internal predecessors, (694), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2024-11-09 07:49:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 732 transitions. [2024-11-09 07:49:14,008 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 732 transitions. Word has length 31 [2024-11-09 07:49:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:14,009 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 732 transitions. [2024-11-09 07:49:14,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-09 07:49:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 732 transitions. [2024-11-09 07:49:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:49:14,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:14,010 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-09 07:49:14,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-09 07:49:14,213 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 (22)] Ended with exit code 0 [2024-11-09 07:49:14,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:14,410 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-09 07:49:14,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash 850193333, now seen corresponding path program 1 times [2024-11-09 07:49:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:14,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112136115] [2024-11-09 07:49:14,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:14,411 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-09 07:49:14,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:14,412 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:14,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 07:49:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:14,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:49:14,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:14,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:14,798 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-09 07:49:14,966 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-09 07:49:14,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:19,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:19,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112136115] [2024-11-09 07:49:19,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112136115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:19,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1921885] [2024-11-09 07:49:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:19,321 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:19,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:19,322 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:49:19,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-09 07:49:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:19,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:49:19,565 INFO L278 TraceCheckSpWp]: Computing forward predicates...