./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.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 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:59:08,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:59:08,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:59:08,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:59:08,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:59:08,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:59:08,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:59:08,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:59:08,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:59:08,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:59:08,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:59:08,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:59:08,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:59:08,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:59:08,235 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:59:08,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:59:08,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:59:08,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:59:08,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:59:08,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:59:08,237 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:59:08,238 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:59:08,238 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:59:08,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:59:08,239 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:59:08,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:59:08,239 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:59:08,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:59:08,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:59:08,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:59:08,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:59:08,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:59:08,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:59:08,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:59:08,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:59:08,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:59:08,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:59:08,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:59:08,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:59:08,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:59:08,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:59:08,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:59:08,246 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2024-10-14 17:59:08,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:59:08,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:59:08,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:59:08,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:59:08,529 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:59:08,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-10-14 17:59:09,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:59:10,222 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:59:10,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-10-14 17:59:10,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7f7b459/a80b16c1794a4cad9bfb814774d127d0/FLAG3cfe1ca15 [2024-10-14 17:59:10,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7f7b459/a80b16c1794a4cad9bfb814774d127d0 [2024-10-14 17:59:10,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:59:10,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:59:10,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:10,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:59:10,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:59:10,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:10" (1/1) ... [2024-10-14 17:59:10,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201e8a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:10, skipping insertion in model container [2024-10-14 17:59:10,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:10" (1/1) ... [2024-10-14 17:59:10,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:59:10,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:59:10,917 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:59:10,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:59:11,013 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:59:11,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11 WrapperNode [2024-10-14 17:59:11,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:11,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:59:11,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:59:11,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:59:11,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,082 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2024-10-14 17:59:11,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:59:11,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:59:11,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:59:11,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:59:11,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,128 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2024-10-14 17:59:11,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:59:11,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:59:11,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:59:11,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:59:11,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (1/1) ... [2024-10-14 17:59:11,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:59:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:11,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:59:11,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:59:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:59:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:59:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 17:59:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-14 17:59:11,238 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-14 17:59:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:59:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:59:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:59:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:59:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:59:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:59:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 17:59:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 17:59:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 17:59:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:59:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:59:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 17:59:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:59:11,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:59:11,357 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:59:11,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:59:11,563 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-14 17:59:11,563 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:59:11,630 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:59:11,631 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 17:59:11,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:11 BoogieIcfgContainer [2024-10-14 17:59:11,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:59:11,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:59:11,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:59:11,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:59:11,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:59:10" (1/3) ... [2024-10-14 17:59:11,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39eafe21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:59:11, skipping insertion in model container [2024-10-14 17:59:11,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:11" (2/3) ... [2024-10-14 17:59:11,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39eafe21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:59:11, skipping insertion in model container [2024-10-14 17:59:11,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:11" (3/3) ... [2024-10-14 17:59:11,652 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2024-10-14 17:59:11,696 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:59:11,696 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-14 17:59:11,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:59:11,738 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;@64f5ec4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:59:11,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-14 17:59:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:59:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:59:11,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:11,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:59:11,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:11,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash 131378568, now seen corresponding path program 1 times [2024-10-14 17:59:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:11,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938754255] [2024-10-14 17:59:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:11,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:12,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938754255] [2024-10-14 17:59:12,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938754255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:12,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:12,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:59:12,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34698210] [2024-10-14 17:59:12,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:59:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:59:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:59:12,167 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:12,325 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2024-10-14 17:59:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:59:12,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:59:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:12,336 INFO L225 Difference]: With dead ends: 121 [2024-10-14 17:59:12,336 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 17:59:12,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:59:12,342 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 146 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:12,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 17:59:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2024-10-14 17:59:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-14 17:59:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2024-10-14 17:59:12,400 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 5 [2024-10-14 17:59:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:12,401 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2024-10-14 17:59:12,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2024-10-14 17:59:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:59:12,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:12,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:59:12,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:59:12,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:12,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 131378569, now seen corresponding path program 1 times [2024-10-14 17:59:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:12,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833841096] [2024-10-14 17:59:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:12,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:12,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833841096] [2024-10-14 17:59:12,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833841096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:12,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:12,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:12,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702145639] [2024-10-14 17:59:12,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:12,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:12,598 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:12,740 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2024-10-14 17:59:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:59:12,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:59:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:12,745 INFO L225 Difference]: With dead ends: 191 [2024-10-14 17:59:12,745 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 17:59:12,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:12,747 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 82 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:12,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 181 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 17:59:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 168. [2024-10-14 17:59:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-10-14 17:59:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2024-10-14 17:59:12,770 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 5 [2024-10-14 17:59:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:12,770 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2024-10-14 17:59:12,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2024-10-14 17:59:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:59:12,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:12,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:59:12,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:59:12,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:12,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash -222231707, now seen corresponding path program 1 times [2024-10-14 17:59:12,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:12,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600404812] [2024-10-14 17:59:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:13,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-10-14 17:59:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600404812] [2024-10-14 17:59:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600404812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:13,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675847075] [2024-10-14 17:59:13,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:13,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:13,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:13,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:13,006 INFO L87 Difference]: Start difference. First operand 168 states and 261 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:13,197 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2024-10-14 17:59:13,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:13,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:59:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:13,201 INFO L225 Difference]: With dead ends: 208 [2024-10-14 17:59:13,201 INFO L226 Difference]: Without dead ends: 208 [2024-10-14 17:59:13,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:13,203 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 67 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:13,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 163 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-14 17:59:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 171. [2024-10-14 17:59:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-10-14 17:59:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions. [2024-10-14 17:59:13,229 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 6 [2024-10-14 17:59:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:13,230 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 264 transitions. [2024-10-14 17:59:13,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions. [2024-10-14 17:59:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:59:13,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:13,231 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:13,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:59:13,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:13,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1700751720, now seen corresponding path program 1 times [2024-10-14 17:59:13,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666420154] [2024-10-14 17:59:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:13,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:13,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666420154] [2024-10-14 17:59:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666420154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:13,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:13,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575334602] [2024-10-14 17:59:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:13,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:13,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:13,467 INFO L87 Difference]: Start difference. First operand 171 states and 264 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:13,589 INFO L93 Difference]: Finished difference Result 193 states and 266 transitions. [2024-10-14 17:59:13,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:13,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:59:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:13,591 INFO L225 Difference]: With dead ends: 193 [2024-10-14 17:59:13,591 INFO L226 Difference]: Without dead ends: 193 [2024-10-14 17:59:13,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:13,593 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 63 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:13,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 193 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-14 17:59:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 171. [2024-10-14 17:59:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-10-14 17:59:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2024-10-14 17:59:13,611 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 7 [2024-10-14 17:59:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:13,612 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2024-10-14 17:59:13,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2024-10-14 17:59:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:59:13,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:13,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:13,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:59:13,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:13,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1183695815, now seen corresponding path program 1 times [2024-10-14 17:59:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:13,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905780513] [2024-10-14 17:59:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:13,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:13,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905780513] [2024-10-14 17:59:13,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905780513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:13,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867509667] [2024-10-14 17:59:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:13,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:13,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:13,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:13,699 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:13,787 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2024-10-14 17:59:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:59:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:13,789 INFO L225 Difference]: With dead ends: 250 [2024-10-14 17:59:13,789 INFO L226 Difference]: Without dead ends: 250 [2024-10-14 17:59:13,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:13,790 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 172 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:13,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 167 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-14 17:59:13,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2024-10-14 17:59:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-10-14 17:59:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 312 transitions. [2024-10-14 17:59:13,803 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 312 transitions. Word has length 8 [2024-10-14 17:59:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:13,803 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 312 transitions. [2024-10-14 17:59:13,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 312 transitions. [2024-10-14 17:59:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:59:13,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:13,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:13,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:59:13,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:13,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1960135350, now seen corresponding path program 1 times [2024-10-14 17:59:13,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:13,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16184969] [2024-10-14 17:59:13,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:13,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16184969] [2024-10-14 17:59:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16184969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:13,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:13,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789968536] [2024-10-14 17:59:13,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:13,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:13,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:13,896 INFO L87 Difference]: Start difference. First operand 207 states and 312 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:13,994 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2024-10-14 17:59:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:13,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:59:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:13,996 INFO L225 Difference]: With dead ends: 245 [2024-10-14 17:59:14,007 INFO L226 Difference]: Without dead ends: 245 [2024-10-14 17:59:14,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:14,009 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 159 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:14,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 188 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-14 17:59:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2024-10-14 17:59:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-10-14 17:59:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2024-10-14 17:59:14,024 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 9 [2024-10-14 17:59:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:14,024 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2024-10-14 17:59:14,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2024-10-14 17:59:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:59:14,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:14,025 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:14,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:59:14,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -519071088, now seen corresponding path program 1 times [2024-10-14 17:59:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356782328] [2024-10-14 17:59:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:14,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:14,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356782328] [2024-10-14 17:59:14,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356782328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:14,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041982570] [2024-10-14 17:59:14,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:14,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:14,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:14,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:14,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:59:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:14,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 17:59:14,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:14,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041982570] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:14,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-10-14 17:59:14,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184780431] [2024-10-14 17:59:14,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:14,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 17:59:14,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:14,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 17:59:14,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:59:14,573 INFO L87 Difference]: Start difference. First operand 217 states and 325 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:14,780 INFO L93 Difference]: Finished difference Result 240 states and 324 transitions. [2024-10-14 17:59:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:59:14,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:59:14,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:14,782 INFO L225 Difference]: With dead ends: 240 [2024-10-14 17:59:14,783 INFO L226 Difference]: Without dead ends: 240 [2024-10-14 17:59:14,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:59:14,784 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 275 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:14,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 330 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-14 17:59:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2024-10-14 17:59:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.5054945054945055) internal successors, (274), 201 states have internal predecessors, (274), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-10-14 17:59:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 319 transitions. [2024-10-14 17:59:14,793 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 319 transitions. Word has length 13 [2024-10-14 17:59:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:14,795 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 319 transitions. [2024-10-14 17:59:14,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 319 transitions. [2024-10-14 17:59:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:59:14,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:14,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:14,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:59:15,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:15,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:15,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:15,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1088665406, now seen corresponding path program 1 times [2024-10-14 17:59:15,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:15,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702900916] [2024-10-14 17:59:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:15,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:15,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702900916] [2024-10-14 17:59:15,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702900916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:15,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551852654] [2024-10-14 17:59:15,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:15,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:15,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:15,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:15,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:59:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:15,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 17:59:15,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:15,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551852654] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:15,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:15,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2024-10-14 17:59:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770092229] [2024-10-14 17:59:15,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:15,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:59:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:59:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:59:15,454 INFO L87 Difference]: Start difference. First operand 220 states and 319 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:15,690 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2024-10-14 17:59:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:59:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 17:59:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:15,696 INFO L225 Difference]: With dead ends: 258 [2024-10-14 17:59:15,697 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 17:59:15,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-14 17:59:15,698 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 204 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:15,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 266 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 17:59:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 228. [2024-10-14 17:59:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 190 states have (on average 1.5) internal successors, (285), 209 states have internal predecessors, (285), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-10-14 17:59:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 330 transitions. [2024-10-14 17:59:15,710 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 330 transitions. Word has length 14 [2024-10-14 17:59:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:15,711 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 330 transitions. [2024-10-14 17:59:15,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 330 transitions. [2024-10-14 17:59:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:59:15,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:15,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:15,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:59:15,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 17:59:15,913 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:15,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -611110737, now seen corresponding path program 1 times [2024-10-14 17:59:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:15,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643025317] [2024-10-14 17:59:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:15,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:16,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:16,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643025317] [2024-10-14 17:59:16,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643025317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:16,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257471035] [2024-10-14 17:59:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:16,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:16,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:16,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:16,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:59:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:16,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 17:59:16,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:16,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:16,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257471035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:16,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:16,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-10-14 17:59:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591297818] [2024-10-14 17:59:16,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:16,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 17:59:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:16,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 17:59:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:59:16,542 INFO L87 Difference]: Start difference. First operand 228 states and 330 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:17,010 INFO L93 Difference]: Finished difference Result 386 states and 532 transitions. [2024-10-14 17:59:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:59:17,011 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:59:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:17,015 INFO L225 Difference]: With dead ends: 386 [2024-10-14 17:59:17,016 INFO L226 Difference]: Without dead ends: 386 [2024-10-14 17:59:17,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 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-10-14 17:59:17,017 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 251 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:17,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 597 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-14 17:59:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 324. [2024-10-14 17:59:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 299 states have internal predecessors, (431), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2024-10-14 17:59:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 495 transitions. [2024-10-14 17:59:17,033 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 495 transitions. Word has length 15 [2024-10-14 17:59:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:17,033 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 495 transitions. [2024-10-14 17:59:17,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 495 transitions. [2024-10-14 17:59:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:59:17,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:17,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:17,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 17:59:17,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:17,236 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:17,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash -905175959, now seen corresponding path program 1 times [2024-10-14 17:59:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:17,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749939834] [2024-10-14 17:59:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:17,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:17,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:17,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749939834] [2024-10-14 17:59:17,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749939834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:17,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:17,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:59:17,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908779772] [2024-10-14 17:59:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:17,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:17,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:17,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:17,287 INFO L87 Difference]: Start difference. First operand 324 states and 495 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:17,315 INFO L93 Difference]: Finished difference Result 335 states and 481 transitions. [2024-10-14 17:59:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:17,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 17:59:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:17,317 INFO L225 Difference]: With dead ends: 335 [2024-10-14 17:59:17,317 INFO L226 Difference]: Without dead ends: 335 [2024-10-14 17:59:17,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:17,318 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:17,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 108 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-14 17:59:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 326. [2024-10-14 17:59:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 285 states have (on average 1.5263157894736843) internal successors, (435), 306 states have internal predecessors, (435), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (33), 11 states have call predecessors, (33), 11 states have call successors, (33) [2024-10-14 17:59:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 479 transitions. [2024-10-14 17:59:17,341 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 479 transitions. Word has length 16 [2024-10-14 17:59:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:17,341 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 479 transitions. [2024-10-14 17:59:17,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 479 transitions. [2024-10-14 17:59:17,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 17:59:17,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:17,344 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:17,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:59:17,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:17,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2085829514, now seen corresponding path program 1 times [2024-10-14 17:59:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811811032] [2024-10-14 17:59:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:17,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:17,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811811032] [2024-10-14 17:59:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811811032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:17,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:59:17,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232117809] [2024-10-14 17:59:17,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:17,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:59:17,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:17,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:59:17,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:59:17,427 INFO L87 Difference]: Start difference. First operand 326 states and 479 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:17,496 INFO L93 Difference]: Finished difference Result 265 states and 369 transitions. [2024-10-14 17:59:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:59:17,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-14 17:59:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:17,498 INFO L225 Difference]: With dead ends: 265 [2024-10-14 17:59:17,498 INFO L226 Difference]: Without dead ends: 265 [2024-10-14 17:59:17,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:59:17,498 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:17,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 72 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-14 17:59:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2024-10-14 17:59:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 221 states have (on average 1.497737556561086) internal successors, (331), 244 states have internal predecessors, (331), 8 states have call successors, (8), 6 states have call predecessors, (8), 12 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2024-10-14 17:59:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 363 transitions. [2024-10-14 17:59:17,511 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 363 transitions. Word has length 23 [2024-10-14 17:59:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:17,511 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 363 transitions. [2024-10-14 17:59:17,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2024-10-14 17:59:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 17:59:17,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:17,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:17,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:59:17,513 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:17,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash 243656846, now seen corresponding path program 1 times [2024-10-14 17:59:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071273969] [2024-10-14 17:59:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:17,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:17,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071273969] [2024-10-14 17:59:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071273969] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975871818] [2024-10-14 17:59:17,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:17,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:17,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:17,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:17,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 17:59:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:17,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 17:59:17,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:18,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:59:18,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:59:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:18,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975871818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:18,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2024-10-14 17:59:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51542572] [2024-10-14 17:59:18,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:18,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 17:59:18,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:18,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 17:59:18,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:59:18,419 INFO L87 Difference]: Start difference. First operand 259 states and 363 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:59:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:18,921 INFO L93 Difference]: Finished difference Result 283 states and 380 transitions. [2024-10-14 17:59:18,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 17:59:18,922 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-14 17:59:18,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:18,923 INFO L225 Difference]: With dead ends: 283 [2024-10-14 17:59:18,924 INFO L226 Difference]: Without dead ends: 283 [2024-10-14 17:59:18,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-14 17:59:18,925 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 387 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:18,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 166 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:18,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-14 17:59:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 273. [2024-10-14 17:59:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 234 states have (on average 1.4572649572649572) internal successors, (341), 258 states have internal predecessors, (341), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-10-14 17:59:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 375 transitions. [2024-10-14 17:59:18,934 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 375 transitions. Word has length 25 [2024-10-14 17:59:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:18,934 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 375 transitions. [2024-10-14 17:59:18,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:59:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 375 transitions. [2024-10-14 17:59:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 17:59:18,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:18,935 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] [2024-10-14 17:59:18,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:59:19,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:19,136 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:19,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash -605850576, now seen corresponding path program 1 times [2024-10-14 17:59:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:19,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668198447] [2024-10-14 17:59:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:19,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:19,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668198447] [2024-10-14 17:59:19,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668198447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:19,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028746054] [2024-10-14 17:59:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:19,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:19,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:19,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:19,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 17:59:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:19,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 17:59:19,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:19,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:19,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028746054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:19,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:59:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-14 17:59:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653682688] [2024-10-14 17:59:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:19,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:19,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:59:19,441 INFO L87 Difference]: Start difference. First operand 273 states and 375 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:19,490 INFO L93 Difference]: Finished difference Result 286 states and 384 transitions. [2024-10-14 17:59:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:19,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-14 17:59:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:19,492 INFO L225 Difference]: With dead ends: 286 [2024-10-14 17:59:19,492 INFO L226 Difference]: Without dead ends: 286 [2024-10-14 17:59:19,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:59:19,493 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:19,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 139 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-14 17:59:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 277. [2024-10-14 17:59:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 238 states have (on average 1.449579831932773) internal successors, (345), 262 states have internal predecessors, (345), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-10-14 17:59:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 379 transitions. [2024-10-14 17:59:19,501 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 379 transitions. Word has length 26 [2024-10-14 17:59:19,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:19,501 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 379 transitions. [2024-10-14 17:59:19,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 379 transitions. [2024-10-14 17:59:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 17:59:19,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:19,502 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:19,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 17:59:19,703 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,SelfDestructingSolverStorable12 [2024-10-14 17:59:19,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:19,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2068973779, now seen corresponding path program 1 times [2024-10-14 17:59:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:19,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640531683] [2024-10-14 17:59:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:19,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:20,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:20,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640531683] [2024-10-14 17:59:20,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640531683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:20,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716750995] [2024-10-14 17:59:20,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:20,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:20,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 17:59:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:20,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:59:20,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:20,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:59:20,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:59:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:20,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:20,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716750995] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:20,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:20,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2024-10-14 17:59:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115384579] [2024-10-14 17:59:20,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 17:59:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 17:59:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:59:20,910 INFO L87 Difference]: Start difference. First operand 277 states and 379 transitions. Second operand has 19 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:59:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:21,453 INFO L93 Difference]: Finished difference Result 284 states and 378 transitions. [2024-10-14 17:59:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:59:21,454 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-10-14 17:59:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:21,455 INFO L225 Difference]: With dead ends: 284 [2024-10-14 17:59:21,455 INFO L226 Difference]: Without dead ends: 284 [2024-10-14 17:59:21,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2024-10-14 17:59:21,456 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 303 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:21,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 235 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-14 17:59:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2024-10-14 17:59:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 238 states have (on average 1.4327731092436975) internal successors, (341), 262 states have internal predecessors, (341), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-10-14 17:59:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 375 transitions. [2024-10-14 17:59:21,463 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 375 transitions. Word has length 27 [2024-10-14 17:59:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 375 transitions. [2024-10-14 17:59:21,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:59:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 375 transitions. [2024-10-14 17:59:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 17:59:21,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:21,467 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:21,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 17:59:21,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:21,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:21,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash 286322338, now seen corresponding path program 1 times [2024-10-14 17:59:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:21,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291703580] [2024-10-14 17:59:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:21,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291703580] [2024-10-14 17:59:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291703580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:21,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552985036] [2024-10-14 17:59:21,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:21,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:21,888 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:21,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 17:59:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:21,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 17:59:21,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:22,049 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 17:59:22,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 17:59:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:22,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552985036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:22,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-10-14 17:59:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702731484] [2024-10-14 17:59:22,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:22,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 17:59:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 17:59:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:59:22,149 INFO L87 Difference]: Start difference. First operand 277 states and 375 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:59:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:22,614 INFO L93 Difference]: Finished difference Result 400 states and 502 transitions. [2024-10-14 17:59:22,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 17:59:22,614 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-14 17:59:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:22,616 INFO L225 Difference]: With dead ends: 400 [2024-10-14 17:59:22,616 INFO L226 Difference]: Without dead ends: 400 [2024-10-14 17:59:22,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 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-10-14 17:59:22,618 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 398 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:22,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 265 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-14 17:59:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 355. [2024-10-14 17:59:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 313 states have (on average 1.3865814696485623) internal successors, (434), 338 states have internal predecessors, (434), 8 states have call successors, (8), 8 states have call predecessors, (8), 16 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2024-10-14 17:59:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 467 transitions. [2024-10-14 17:59:22,628 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 467 transitions. Word has length 28 [2024-10-14 17:59:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:22,630 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 467 transitions. [2024-10-14 17:59:22,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:59:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 467 transitions. [2024-10-14 17:59:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:59:22,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:22,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:22,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 17:59:22,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:22,832 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:22,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash 286057935, now seen corresponding path program 1 times [2024-10-14 17:59:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35807302] [2024-10-14 17:59:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35807302] [2024-10-14 17:59:23,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35807302] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927840622] [2024-10-14 17:59:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:23,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:23,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:23,090 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:23,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 17:59:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:23,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 17:59:23,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:23,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:59:23,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:59:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:23,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927840622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:23,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2024-10-14 17:59:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977085244] [2024-10-14 17:59:23,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:23,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:59:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:23,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:59:23,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:59:23,481 INFO L87 Difference]: Start difference. First operand 355 states and 467 transitions. Second operand has 16 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:59:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:24,072 INFO L93 Difference]: Finished difference Result 421 states and 517 transitions. [2024-10-14 17:59:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 17:59:24,073 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-14 17:59:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:24,074 INFO L225 Difference]: With dead ends: 421 [2024-10-14 17:59:24,075 INFO L226 Difference]: Without dead ends: 421 [2024-10-14 17:59:24,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 17:59:24,076 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 550 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:24,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 342 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-14 17:59:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 371. [2024-10-14 17:59:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 328 states have (on average 1.3932926829268293) internal successors, (457), 354 states have internal predecessors, (457), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 486 transitions. [2024-10-14 17:59:24,085 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 486 transitions. Word has length 29 [2024-10-14 17:59:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:24,085 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 486 transitions. [2024-10-14 17:59:24,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:59:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 486 transitions. [2024-10-14 17:59:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 17:59:24,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:24,086 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:24,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 17:59:24,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 17:59:24,287 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:24,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:24,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1370226837, now seen corresponding path program 1 times [2024-10-14 17:59:24,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:24,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087577822] [2024-10-14 17:59:24,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:24,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:24,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:24,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:24,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087577822] [2024-10-14 17:59:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087577822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:24,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937666063] [2024-10-14 17:59:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:24,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:24,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:24,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:24,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 17:59:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:24,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 17:59:24,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:24,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:59:24,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:59:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:24,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:25,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937666063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:25,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:25,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2024-10-14 17:59:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514770696] [2024-10-14 17:59:25,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:25,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 17:59:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:25,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 17:59:25,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:59:25,172 INFO L87 Difference]: Start difference. First operand 371 states and 486 transitions. Second operand has 18 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:59:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:25,668 INFO L93 Difference]: Finished difference Result 388 states and 486 transitions. [2024-10-14 17:59:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 17:59:25,669 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-14 17:59:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:25,670 INFO L225 Difference]: With dead ends: 388 [2024-10-14 17:59:25,670 INFO L226 Difference]: Without dead ends: 388 [2024-10-14 17:59:25,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=878, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 17:59:25,672 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 502 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:25,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 245 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-14 17:59:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 370. [2024-10-14 17:59:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 330 states have (on average 1.3333333333333333) internal successors, (440), 353 states have internal predecessors, (440), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 469 transitions. [2024-10-14 17:59:25,681 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 469 transitions. Word has length 33 [2024-10-14 17:59:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:25,682 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 469 transitions. [2024-10-14 17:59:25,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:59:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 469 transitions. [2024-10-14 17:59:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 17:59:25,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:25,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:25,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 17:59:25,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 17:59:25,884 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:25,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:25,885 INFO L85 PathProgramCache]: Analyzing trace with hash -675206682, now seen corresponding path program 1 times [2024-10-14 17:59:25,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:25,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265011654] [2024-10-14 17:59:25,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:25,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:25,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265011654] [2024-10-14 17:59:25,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265011654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408467451] [2024-10-14 17:59:25,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:25,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:25,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 17:59:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:26,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:59:26,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:26,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408467451] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:26,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-14 17:59:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111974055] [2024-10-14 17:59:26,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:26,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:26,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:26,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:26,118 INFO L87 Difference]: Start difference. First operand 370 states and 469 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:26,204 INFO L93 Difference]: Finished difference Result 371 states and 466 transitions. [2024-10-14 17:59:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:26,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-10-14 17:59:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:26,206 INFO L225 Difference]: With dead ends: 371 [2024-10-14 17:59:26,206 INFO L226 Difference]: Without dead ends: 371 [2024-10-14 17:59:26,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:59:26,206 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 76 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:26,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 68 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-14 17:59:26,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2024-10-14 17:59:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 330 states have (on average 1.3151515151515152) internal successors, (434), 351 states have internal predecessors, (434), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 463 transitions. [2024-10-14 17:59:26,215 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 463 transitions. Word has length 37 [2024-10-14 17:59:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:26,216 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 463 transitions. [2024-10-14 17:59:26,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 463 transitions. [2024-10-14 17:59:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 17:59:26,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:26,217 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:26,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 17:59:26,418 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,SelfDestructingSolverStorable17 [2024-10-14 17:59:26,419 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:26,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:26,419 INFO L85 PathProgramCache]: Analyzing trace with hash 543429436, now seen corresponding path program 1 times [2024-10-14 17:59:26,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:26,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770066539] [2024-10-14 17:59:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:26,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770066539] [2024-10-14 17:59:26,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770066539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836072605] [2024-10-14 17:59:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:26,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:26,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:26,503 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:26,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 17:59:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:26,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:59:26,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:26,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:26,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836072605] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:26,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:26,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-14 17:59:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257621673] [2024-10-14 17:59:26,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:26,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:26,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:26,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:26,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:26,677 INFO L87 Difference]: Start difference. First operand 368 states and 463 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:26,766 INFO L93 Difference]: Finished difference Result 369 states and 460 transitions. [2024-10-14 17:59:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-10-14 17:59:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:26,768 INFO L225 Difference]: With dead ends: 369 [2024-10-14 17:59:26,768 INFO L226 Difference]: Without dead ends: 369 [2024-10-14 17:59:26,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:59:26,769 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 72 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:26,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 49 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-14 17:59:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2024-10-14 17:59:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 330 states have (on average 1.2969696969696969) internal successors, (428), 349 states have internal predecessors, (428), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 457 transitions. [2024-10-14 17:59:26,777 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 457 transitions. Word has length 38 [2024-10-14 17:59:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:26,777 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 457 transitions. [2024-10-14 17:59:26,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 457 transitions. [2024-10-14 17:59:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 17:59:26,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:26,778 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:26,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 17:59:26,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:26,979 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:26,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash -333556568, now seen corresponding path program 1 times [2024-10-14 17:59:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:26,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856796106] [2024-10-14 17:59:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:27,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856796106] [2024-10-14 17:59:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856796106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979898681] [2024-10-14 17:59:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:27,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:27,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:27,131 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:27,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 17:59:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:27,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 17:59:27,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:27,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:59:27,254 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 17:59:27,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 17:59:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:27,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979898681] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:27,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:27,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-14 17:59:27,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782653456] [2024-10-14 17:59:27,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:27,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:27,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:27,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:27,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:27,322 INFO L87 Difference]: Start difference. First operand 366 states and 457 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:27,461 INFO L93 Difference]: Finished difference Result 394 states and 484 transitions. [2024-10-14 17:59:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:59:27,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-10-14 17:59:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:27,463 INFO L225 Difference]: With dead ends: 394 [2024-10-14 17:59:27,463 INFO L226 Difference]: Without dead ends: 394 [2024-10-14 17:59:27,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:59:27,464 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:27,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 104 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-14 17:59:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 366. [2024-10-14 17:59:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 330 states have (on average 1.290909090909091) internal successors, (426), 349 states have internal predecessors, (426), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 455 transitions. [2024-10-14 17:59:27,475 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 455 transitions. Word has length 39 [2024-10-14 17:59:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 455 transitions. [2024-10-14 17:59:27,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 455 transitions. [2024-10-14 17:59:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 17:59:27,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:27,477 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:27,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 17:59:27,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:27,677 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:27,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash 626468027, now seen corresponding path program 1 times [2024-10-14 17:59:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:27,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381372946] [2024-10-14 17:59:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:27,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:27,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381372946] [2024-10-14 17:59:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381372946] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599841354] [2024-10-14 17:59:27,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:27,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:27,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:27,753 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:27,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 17:59:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:27,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:59:27,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:59:27,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599841354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:27,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:59:27,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-14 17:59:27,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924101310] [2024-10-14 17:59:27,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:27,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:27,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:27,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:59:27,864 INFO L87 Difference]: Start difference. First operand 366 states and 455 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:27,885 INFO L93 Difference]: Finished difference Result 359 states and 434 transitions. [2024-10-14 17:59:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:27,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2024-10-14 17:59:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:27,887 INFO L225 Difference]: With dead ends: 359 [2024-10-14 17:59:27,887 INFO L226 Difference]: Without dead ends: 359 [2024-10-14 17:59:27,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:59:27,888 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:27,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 128 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-14 17:59:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2024-10-14 17:59:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 321 states have (on average 1.2616822429906542) internal successors, (405), 340 states have internal predecessors, (405), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 434 transitions. [2024-10-14 17:59:27,894 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 434 transitions. Word has length 43 [2024-10-14 17:59:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:27,895 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 434 transitions. [2024-10-14 17:59:27,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 434 transitions. [2024-10-14 17:59:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 17:59:27,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:27,895 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:27,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-14 17:59:28,099 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,SelfDestructingSolverStorable20 [2024-10-14 17:59:28,100 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:28,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:28,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1194939939, now seen corresponding path program 1 times [2024-10-14 17:59:28,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:28,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615675090] [2024-10-14 17:59:28,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:28,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:28,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 17:59:28,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:28,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615675090] [2024-10-14 17:59:28,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615675090] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:28,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684297383] [2024-10-14 17:59:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:28,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:28,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:28,151 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:28,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 17:59:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:28,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:59:28,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 17:59:28,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:28,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684297383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:28,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:59:28,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-14 17:59:28,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687689549] [2024-10-14 17:59:28,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:28,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:28,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:28,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:28,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:28,250 INFO L87 Difference]: Start difference. First operand 357 states and 434 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:28,260 INFO L93 Difference]: Finished difference Result 356 states and 431 transitions. [2024-10-14 17:59:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:28,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-14 17:59:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:28,261 INFO L225 Difference]: With dead ends: 356 [2024-10-14 17:59:28,261 INFO L226 Difference]: Without dead ends: 356 [2024-10-14 17:59:28,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:28,262 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:28,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-14 17:59:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-14 17:59:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 321 states have (on average 1.2523364485981308) internal successors, (402), 339 states have internal predecessors, (402), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 431 transitions. [2024-10-14 17:59:28,268 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 431 transitions. Word has length 44 [2024-10-14 17:59:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:28,269 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 431 transitions. [2024-10-14 17:59:28,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 431 transitions. [2024-10-14 17:59:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 17:59:28,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:28,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:28,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 17:59:28,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:28,470 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:28,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1611567629, now seen corresponding path program 1 times [2024-10-14 17:59:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:28,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684735082] [2024-10-14 17:59:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:28,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 17:59:28,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:28,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684735082] [2024-10-14 17:59:28,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684735082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:28,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164722302] [2024-10-14 17:59:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:28,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:28,533 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:28,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 17:59:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:28,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:59:28,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 17:59:28,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164722302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:28,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:59:28,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2024-10-14 17:59:28,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986845673] [2024-10-14 17:59:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:28,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:59:28,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:28,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:59:28,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:28,680 INFO L87 Difference]: Start difference. First operand 356 states and 431 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:28,701 INFO L93 Difference]: Finished difference Result 355 states and 428 transitions. [2024-10-14 17:59:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:59:28,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-14 17:59:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:28,704 INFO L225 Difference]: With dead ends: 355 [2024-10-14 17:59:28,704 INFO L226 Difference]: Without dead ends: 355 [2024-10-14 17:59:28,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:28,705 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:28,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 79 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-14 17:59:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2024-10-14 17:59:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 321 states have (on average 1.2429906542056075) internal successors, (399), 338 states have internal predecessors, (399), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 428 transitions. [2024-10-14 17:59:28,715 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 428 transitions. Word has length 45 [2024-10-14 17:59:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:28,715 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 428 transitions. [2024-10-14 17:59:28,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 428 transitions. [2024-10-14 17:59:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 17:59:28,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:28,716 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:28,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 17:59:28,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:28,917 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:28,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1581010977, now seen corresponding path program 1 times [2024-10-14 17:59:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:28,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429618295] [2024-10-14 17:59:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 17:59:28,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429618295] [2024-10-14 17:59:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429618295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579956231] [2024-10-14 17:59:28,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:28,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:28,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:28,971 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:28,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 17:59:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:29,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:59:29,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 17:59:29,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:29,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579956231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:29,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:59:29,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-14 17:59:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607976983] [2024-10-14 17:59:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:29,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:29,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:29,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:29,072 INFO L87 Difference]: Start difference. First operand 355 states and 428 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:29,083 INFO L93 Difference]: Finished difference Result 354 states and 425 transitions. [2024-10-14 17:59:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:29,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 46 [2024-10-14 17:59:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:29,087 INFO L225 Difference]: With dead ends: 354 [2024-10-14 17:59:29,087 INFO L226 Difference]: Without dead ends: 354 [2024-10-14 17:59:29,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:29,088 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:29,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-14 17:59:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-14 17:59:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 321 states have (on average 1.233644859813084) internal successors, (396), 337 states have internal predecessors, (396), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 425 transitions. [2024-10-14 17:59:29,095 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 425 transitions. Word has length 46 [2024-10-14 17:59:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:29,095 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 425 transitions. [2024-10-14 17:59:29,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 425 transitions. [2024-10-14 17:59:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 17:59:29,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:29,096 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:29,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-14 17:59:29,296 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,SelfDestructingSolverStorable23 [2024-10-14 17:59:29,297 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -692968788, now seen corresponding path program 1 times [2024-10-14 17:59:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:29,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995569289] [2024-10-14 17:59:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:29,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 17:59:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:59:29,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:29,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995569289] [2024-10-14 17:59:29,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995569289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:29,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122489747] [2024-10-14 17:59:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:29,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:29,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:29,612 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:29,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-14 17:59:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:29,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 17:59:29,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:29,798 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:59:29,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 17:59:29,914 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 17:59:29,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 17:59:29,953 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 17:59:29,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 17:59:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:30,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:30,049 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-14 17:59:30,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2024-10-14 17:59:30,226 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-14 17:59:30,227 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 56 treesize of output 53 [2024-10-14 17:59:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:30,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122489747] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:30,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:30,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 25 [2024-10-14 17:59:30,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020546292] [2024-10-14 17:59:30,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:30,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:59:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:30,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:59:30,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:59:30,387 INFO L87 Difference]: Start difference. First operand 354 states and 425 transitions. Second operand has 26 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 24 states have internal predecessors, (123), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 17:59:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:30,640 INFO L93 Difference]: Finished difference Result 360 states and 429 transitions. [2024-10-14 17:59:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:59:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 24 states have internal predecessors, (123), 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 48 [2024-10-14 17:59:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:30,642 INFO L225 Difference]: With dead ends: 360 [2024-10-14 17:59:30,642 INFO L226 Difference]: Without dead ends: 360 [2024-10-14 17:59:30,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2024-10-14 17:59:30,644 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 197 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:30,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 132 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-14 17:59:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 354. [2024-10-14 17:59:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 321 states have (on average 1.2305295950155763) internal successors, (395), 337 states have internal predecessors, (395), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-14 17:59:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 424 transitions. [2024-10-14 17:59:30,650 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 424 transitions. Word has length 48 [2024-10-14 17:59:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:30,650 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 424 transitions. [2024-10-14 17:59:30,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 24 states have internal predecessors, (123), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 17:59:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 424 transitions. [2024-10-14 17:59:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 17:59:30,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:30,651 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] [2024-10-14 17:59:30,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-14 17:59:30,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:30,852 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:30,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1799098819, now seen corresponding path program 1 times [2024-10-14 17:59:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:30,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629711902] [2024-10-14 17:59:30,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:30,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:30,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 17:59:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:59:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629711902] [2024-10-14 17:59:30,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629711902] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736469221] [2024-10-14 17:59:30,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:30,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:30,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:30,977 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:30,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-14 17:59:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:31,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 17:59:31,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:31,119 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_parse_input_c1_~x~0#1.base_77| Int)) (and (<= |v_parse_input_c1_~x~0#1.base_77| c_~global~0.base) (= |c_#valid| (store |c_old(#valid)| |v_parse_input_c1_~x~0#1.base_77| (select |c_#valid| |v_parse_input_c1_~x~0#1.base_77|))))) is different from true [2024-10-14 17:59:31,146 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 17:59:31,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 17:59:31,303 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 17:59:31,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 17:59:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-14 17:59:31,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736469221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:31,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 17 [2024-10-14 17:59:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518328802] [2024-10-14 17:59:31,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:31,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 17:59:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:31,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 17:59:31,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-10-14 17:59:31,428 INFO L87 Difference]: Start difference. First operand 354 states and 424 transitions. Second operand has 17 states, 15 states have (on average 5.733333333333333) internal successors, (86), 14 states have internal predecessors, (86), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 17:59:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:32,163 INFO L93 Difference]: Finished difference Result 332 states and 381 transitions. [2024-10-14 17:59:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 17:59:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.733333333333333) internal successors, (86), 14 states have internal predecessors, (86), 5 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 48 [2024-10-14 17:59:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:32,164 INFO L225 Difference]: With dead ends: 332 [2024-10-14 17:59:32,164 INFO L226 Difference]: Without dead ends: 332 [2024-10-14 17:59:32,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=308, Invalid=1177, Unknown=1, NotChecked=74, Total=1560 [2024-10-14 17:59:32,165 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 356 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:32,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 362 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 572 Invalid, 0 Unknown, 189 Unchecked, 0.4s Time] [2024-10-14 17:59:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-14 17:59:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 311. [2024-10-14 17:59:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 283 states have (on average 1.2084805653710247) internal successors, (342), 296 states have internal predecessors, (342), 7 states have call successors, (7), 7 states have call predecessors, (7), 13 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2024-10-14 17:59:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 364 transitions. [2024-10-14 17:59:32,171 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 364 transitions. Word has length 48 [2024-10-14 17:59:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:32,171 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 364 transitions. [2024-10-14 17:59:32,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.733333333333333) internal successors, (86), 14 states have internal predecessors, (86), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 17:59:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 364 transitions. [2024-10-14 17:59:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 17:59:32,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:32,172 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:32,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-14 17:59:32,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:32,378 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:32,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash -7195967, now seen corresponding path program 1 times [2024-10-14 17:59:32,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128525422] [2024-10-14 17:59:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 17:59:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:59:33,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:33,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128525422] [2024-10-14 17:59:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128525422] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:33,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367519866] [2024-10-14 17:59:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:33,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:33,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:33,155 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:33,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-14 17:59:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:33,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 17:59:33,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:33,418 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:59:33,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 17:59:33,635 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 17:59:33,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 17:59:33,669 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 17:59:33,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 17:59:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:33,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:33,901 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-10-14 17:59:33,901 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 88 treesize of output 81 [2024-10-14 17:59:34,114 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-10-14 17:59:34,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2024-10-14 17:59:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:34,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367519866] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:34,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:34,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 14] total 44 [2024-10-14 17:59:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024992108] [2024-10-14 17:59:34,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:34,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-14 17:59:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-14 17:59:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1856, Unknown=0, NotChecked=0, Total=2070 [2024-10-14 17:59:34,463 INFO L87 Difference]: Start difference. First operand 311 states and 364 transitions. Second operand has 46 states, 40 states have (on average 3.275) internal successors, (131), 37 states have internal predecessors, (131), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:59:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:35,233 INFO L93 Difference]: Finished difference Result 326 states and 375 transitions. [2024-10-14 17:59:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 17:59:35,233 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 40 states have (on average 3.275) internal successors, (131), 37 states have internal predecessors, (131), 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 49 [2024-10-14 17:59:35,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:35,235 INFO L225 Difference]: With dead ends: 326 [2024-10-14 17:59:35,235 INFO L226 Difference]: Without dead ends: 326 [2024-10-14 17:59:35,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=500, Invalid=2692, Unknown=0, NotChecked=0, Total=3192 [2024-10-14 17:59:35,236 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 545 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:35,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 300 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:59:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-14 17:59:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 311. [2024-10-14 17:59:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 283 states have (on average 1.204946996466431) internal successors, (341), 296 states have internal predecessors, (341), 7 states have call successors, (7), 7 states have call predecessors, (7), 13 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2024-10-14 17:59:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 363 transitions. [2024-10-14 17:59:35,243 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 363 transitions. Word has length 49 [2024-10-14 17:59:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:35,244 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 363 transitions. [2024-10-14 17:59:35,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 40 states have (on average 3.275) internal successors, (131), 37 states have internal predecessors, (131), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:59:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 363 transitions. [2024-10-14 17:59:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 17:59:35,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:35,245 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:35,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-14 17:59:35,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:35,446 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:35,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:35,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1286570351, now seen corresponding path program 1 times [2024-10-14 17:59:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:35,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182346853] [2024-10-14 17:59:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:35,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:35,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 17:59:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182346853] [2024-10-14 17:59:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182346853] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509506019] [2024-10-14 17:59:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:35,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:35,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:35,498 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:35,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-14 17:59:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:35,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:59:35,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 17:59:35,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:35,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509506019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:35,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:59:35,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-14 17:59:35,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710954753] [2024-10-14 17:59:35,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:35,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:35,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:35,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:35,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:59:35,598 INFO L87 Difference]: Start difference. First operand 311 states and 363 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:35,606 INFO L93 Difference]: Finished difference Result 252 states and 286 transitions. [2024-10-14 17:59:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:35,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 49 [2024-10-14 17:59:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:35,607 INFO L225 Difference]: With dead ends: 252 [2024-10-14 17:59:35,607 INFO L226 Difference]: Without dead ends: 252 [2024-10-14 17:59:35,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:59:35,608 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:35,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-14 17:59:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2024-10-14 17:59:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 228 states have (on average 1.1754385964912282) internal successors, (268), 236 states have internal predecessors, (268), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-14 17:59:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 283 transitions. [2024-10-14 17:59:35,612 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 283 transitions. Word has length 49 [2024-10-14 17:59:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:35,613 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 283 transitions. [2024-10-14 17:59:35,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:59:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 283 transitions. [2024-10-14 17:59:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 17:59:35,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:35,613 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:35,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-14 17:59:35,814 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,SelfDestructingSolverStorable27 [2024-10-14 17:59:35,815 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:35,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:35,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1846003179, now seen corresponding path program 1 times [2024-10-14 17:59:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:35,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370200333] [2024-10-14 17:59:35,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:35,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:35,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 17:59:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 17:59:36,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370200333] [2024-10-14 17:59:36,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370200333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532126143] [2024-10-14 17:59:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:36,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:36,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:36,095 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:36,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-14 17:59:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:36,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:59:36,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:36,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:59:36,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:59:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 17:59:36,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:36,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532126143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:36,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:36,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2024-10-14 17:59:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401055047] [2024-10-14 17:59:36,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:36,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:59:36,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:36,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:59:36,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:59:36,514 INFO L87 Difference]: Start difference. First operand 249 states and 283 transitions. Second operand has 16 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:59:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:36,950 INFO L93 Difference]: Finished difference Result 260 states and 288 transitions. [2024-10-14 17:59:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 17:59:36,950 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-10-14 17:59:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:36,951 INFO L225 Difference]: With dead ends: 260 [2024-10-14 17:59:36,951 INFO L226 Difference]: Without dead ends: 260 [2024-10-14 17:59:36,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 17:59:36,952 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 313 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:36,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 172 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-14 17:59:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 248. [2024-10-14 17:59:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 228 states have (on average 1.1491228070175439) internal successors, (262), 235 states have internal predecessors, (262), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-14 17:59:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 277 transitions. [2024-10-14 17:59:36,956 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 277 transitions. Word has length 51 [2024-10-14 17:59:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:36,957 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 277 transitions. [2024-10-14 17:59:36,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:59:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 277 transitions. [2024-10-14 17:59:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 17:59:36,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:36,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:36,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-14 17:59:37,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-14 17:59:37,163 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:37,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:37,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1674611747, now seen corresponding path program 1 times [2024-10-14 17:59:37,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:37,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686984705] [2024-10-14 17:59:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:37,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:37,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 17:59:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:59:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:37,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686984705] [2024-10-14 17:59:37,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686984705] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:37,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080308496] [2024-10-14 17:59:37,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:37,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:37,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:37,565 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:37,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-14 17:59:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:37,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:59:37,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:37,736 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 17:59:37,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 17:59:37,950 INFO L349 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2024-10-14 17:59:37,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2024-10-14 17:59:38,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2024-10-14 17:59:38,046 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-10-14 17:59:38,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 1 [2024-10-14 17:59:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:38,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080308496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:38,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:38,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-10-14 17:59:38,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845452301] [2024-10-14 17:59:38,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:38,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 17:59:38,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:38,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 17:59:38,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:59:38,144 INFO L87 Difference]: Start difference. First operand 248 states and 277 transitions. Second operand has 21 states, 18 states have (on average 4.5) internal successors, (81), 16 states have internal predecessors, (81), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:59:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:38,750 INFO L93 Difference]: Finished difference Result 256 states and 285 transitions. [2024-10-14 17:59:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 17:59:38,751 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.5) internal successors, (81), 16 states have internal predecessors, (81), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-10-14 17:59:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:38,751 INFO L225 Difference]: With dead ends: 256 [2024-10-14 17:59:38,752 INFO L226 Difference]: Without dead ends: 256 [2024-10-14 17:59:38,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 17:59:38,753 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 252 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:38,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 264 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-14 17:59:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 247. [2024-10-14 17:59:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 228 states have (on average 1.144736842105263) internal successors, (261), 234 states have internal predecessors, (261), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-14 17:59:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 276 transitions. [2024-10-14 17:59:38,757 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 276 transitions. Word has length 51 [2024-10-14 17:59:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:38,757 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 276 transitions. [2024-10-14 17:59:38,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.5) internal successors, (81), 16 states have internal predecessors, (81), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:59:38,758 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 276 transitions. [2024-10-14 17:59:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 17:59:38,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:38,759 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:38,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-10-14 17:59:38,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:38,963 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash -978466150, now seen corresponding path program 1 times [2024-10-14 17:59:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254561735] [2024-10-14 17:59:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:39,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 17:59:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:59:39,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:39,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254561735] [2024-10-14 17:59:39,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254561735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:39,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348752072] [2024-10-14 17:59:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:39,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:39,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:39,472 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:39,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-14 17:59:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:39,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-14 17:59:39,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:39,835 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 17:59:39,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 17:59:40,310 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2024-10-14 17:59:40,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 67 [2024-10-14 17:59:40,359 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-10-14 17:59:40,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 14 [2024-10-14 17:59:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:40,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:41,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348752072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:41,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2024-10-14 17:59:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138991127] [2024-10-14 17:59:41,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:41,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 17:59:41,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:41,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 17:59:41,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1307, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 17:59:41,199 INFO L87 Difference]: Start difference. First operand 247 states and 276 transitions. Second operand has 33 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 27 states have internal predecessors, (104), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 17:59:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:42,742 INFO L93 Difference]: Finished difference Result 258 states and 286 transitions. [2024-10-14 17:59:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 17:59:42,743 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 27 states have internal predecessors, (104), 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 57 [2024-10-14 17:59:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:42,743 INFO L225 Difference]: With dead ends: 258 [2024-10-14 17:59:42,744 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 17:59:42,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=622, Invalid=2918, Unknown=0, NotChecked=0, Total=3540 [2024-10-14 17:59:42,745 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 358 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:42,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 314 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:59:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 17:59:42,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2024-10-14 17:59:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 228 states have (on average 1.1403508771929824) internal successors, (260), 233 states have internal predecessors, (260), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-14 17:59:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 275 transitions. [2024-10-14 17:59:42,750 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 275 transitions. Word has length 57 [2024-10-14 17:59:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:42,750 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 275 transitions. [2024-10-14 17:59:42,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 27 states have internal predecessors, (104), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 17:59:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 275 transitions. [2024-10-14 17:59:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 17:59:42,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:42,751 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:42,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-14 17:59:42,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:42,956 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:42,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash -267679533, now seen corresponding path program 1 times [2024-10-14 17:59:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:42,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277322466] [2024-10-14 17:59:42,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:42,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:43,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 17:59:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:59:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277322466] [2024-10-14 17:59:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277322466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14774272] [2024-10-14 17:59:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:43,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:43,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:43,647 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:43,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-14 17:59:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:43,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 17:59:43,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:44,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:59:44,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 17:59:44,279 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 17:59:44,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 17:59:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:44,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14774272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:44,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 27 [2024-10-14 17:59:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163294975] [2024-10-14 17:59:44,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:44,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 17:59:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 17:59:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 17:59:44,647 INFO L87 Difference]: Start difference. First operand 246 states and 275 transitions. Second operand has 29 states, 24 states have (on average 4.416666666666667) internal successors, (106), 23 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-10-14 17:59:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:45,710 INFO L93 Difference]: Finished difference Result 271 states and 298 transitions. [2024-10-14 17:59:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 17:59:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 4.416666666666667) internal successors, (106), 23 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-10-14 17:59:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:45,712 INFO L225 Difference]: With dead ends: 271 [2024-10-14 17:59:45,712 INFO L226 Difference]: Without dead ends: 271 [2024-10-14 17:59:45,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=538, Invalid=2324, Unknown=0, NotChecked=0, Total=2862 [2024-10-14 17:59:45,713 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 436 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:45,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 174 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-14 17:59:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 245. [2024-10-14 17:59:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 228 states have (on average 1.1359649122807018) internal successors, (259), 232 states have internal predecessors, (259), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-14 17:59:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2024-10-14 17:59:45,717 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 58 [2024-10-14 17:59:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:45,718 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2024-10-14 17:59:45,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 4.416666666666667) internal successors, (106), 23 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-10-14 17:59:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2024-10-14 17:59:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 17:59:45,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:45,719 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:45,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-10-14 17:59:45,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:45,919 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:45,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1896944505, now seen corresponding path program 1 times [2024-10-14 17:59:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:45,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940279280] [2024-10-14 17:59:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:46,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 17:59:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:46,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 17:59:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:59:46,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:46,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940279280] [2024-10-14 17:59:46,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940279280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:46,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107822254] [2024-10-14 17:59:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:46,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:46,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:46,188 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:46,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-14 17:59:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:46,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 17:59:46,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:46,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:59:46,406 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 17:59:46,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2024-10-14 17:59:46,427 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 17:59:46,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 17:59:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:46,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:46,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107822254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:46,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:46,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-10-14 17:59:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829666062] [2024-10-14 17:59:46,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:46,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 17:59:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:46,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 17:59:46,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:59:46,491 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 17:59:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:46,655 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions. [2024-10-14 17:59:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:59:46,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2024-10-14 17:59:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:46,657 INFO L225 Difference]: With dead ends: 256 [2024-10-14 17:59:46,657 INFO L226 Difference]: Without dead ends: 256 [2024-10-14 17:59:46,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:59:46,657 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:46,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 156 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-14 17:59:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 201. [2024-10-14 17:59:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 188 states have (on average 1.1329787234042554) internal successors, (213), 190 states have internal predecessors, (213), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-14 17:59:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2024-10-14 17:59:46,668 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 62 [2024-10-14 17:59:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:46,669 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2024-10-14 17:59:46,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 17:59:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2024-10-14 17:59:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 17:59:46,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:46,673 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:46,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-14 17:59:46,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-14 17:59:46,878 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:46,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1264923100, now seen corresponding path program 1 times [2024-10-14 17:59:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:46,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302805339] [2024-10-14 17:59:46,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:59:46,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:59:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:59:46,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:59:46,935 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:59:46,936 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-10-14 17:59:46,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-10-14 17:59:46,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2024-10-14 17:59:46,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2024-10-14 17:59:46,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2024-10-14 17:59:46,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2024-10-14 17:59:46,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2024-10-14 17:59:46,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2024-10-14 17:59:46,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-10-14 17:59:46,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-10-14 17:59:46,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-10-14 17:59:46,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 17:59:46,946 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:47,026 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:59:47,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:59:47 BoogieIcfgContainer [2024-10-14 17:59:47,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:59:47,033 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:59:47,033 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:59:47,033 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:59:47,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:11" (3/4) ... [2024-10-14 17:59:47,035 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 17:59:47,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:59:47,037 INFO L158 Benchmark]: Toolchain (without parser) took 36480.74ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 112.4MB in the beginning and 337.2MB in the end (delta: -224.8MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-10-14 17:59:47,037 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:59:47,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.68ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 91.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 17:59:47,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.83ms. Allocated memory is still 167.8MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:59:47,038 INFO L158 Benchmark]: Boogie Preprocessor took 67.58ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 86.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:59:47,038 INFO L158 Benchmark]: RCFGBuilder took 480.45ms. Allocated memory is still 167.8MB. Free memory was 86.3MB in the beginning and 135.6MB in the end (delta: -49.3MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-10-14 17:59:47,038 INFO L158 Benchmark]: TraceAbstraction took 35395.46ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 134.7MB in the beginning and 337.2MB in the end (delta: -202.5MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-10-14 17:59:47,040 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 394.3MB. Free memory is still 337.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:59:47,041 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 167.8MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.68ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 91.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.83ms. Allocated memory is still 167.8MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.58ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 86.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.45ms. Allocated memory is still 167.8MB. Free memory was 86.3MB in the beginning and 135.6MB in the end (delta: -49.3MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * TraceAbstraction took 35395.46ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 134.7MB in the beginning and 337.2MB in the end (delta: -202.5MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 394.3MB. Free memory is still 337.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L722] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, input={3:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=2, input={3:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, input={3:0}, state=0] [L722] RET parse_input("c1") VAL [commands={6:0}, global={0:0}, state=0] [L723] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=1, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=1, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=1, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=1, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=1, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=1, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=1, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, i=2, input={4:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(input)={4:0}, \old(state)=0, commands={6:0}, global={0:0}, input={4:0}, state=0] [L723] RET parse_input("c1") VAL [commands={6:0}, global={0:0}, state=0] [L724] CALL parse_input("c2") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={5:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(input)={5:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={5:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={5:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={5:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={5:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={5:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={5:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={5:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={5:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={-3:0}, state=1] [L695] RET commands[i].function() [L724] RET parse_input("c2") VAL [commands={6:0}, global={-3:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={-3: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: 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. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 35.2s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6480 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6480 mSDsluCounter, 6331 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 189 IncrementalHoareTripleChecker+Unchecked, 4899 mSDsCounter, 699 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7597 IncrementalHoareTripleChecker+Invalid, 8485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 699 mSolverCounterUnsat, 1432 mSDtfsCounter, 7597 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1783 GetRequests, 1207 SyntacticMatches, 8 SemanticMatches, 568 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4073 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=16, 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.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 640 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 2096 NumberOfCodeBlocks, 2096 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2216 ConstructedInterpolants, 130 QuantifiedInterpolants, 23051 SizeOfPredicates, 82 NumberOfNonLiveVariables, 6352 ConjunctsInSsa, 433 ConjunctsInUnsatCore, 66 InterpolantComputations, 14 PerfectInterpolantSequences, 591/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-10-14 17:59:47,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.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 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:59:49,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:59:49,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 17:59:49,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:59:49,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:59:49,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:59:49,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:59:49,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:59:49,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:59:49,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:59:49,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:59:49,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:59:49,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:59:49,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:59:49,292 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:59:49,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:59:49,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:59:49,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:59:49,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:59:49,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:59:49,294 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:59:49,295 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:59:49,295 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:59:49,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:59:49,296 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:59:49,296 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:59:49,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:59:49,297 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:59:49,297 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:59:49,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:59:49,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:59:49,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:59:49,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:59:49,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:59:49,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:59:49,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:59:49,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:59:49,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:59:49,304 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:59:49,305 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:59:49,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:59:49,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:59:49,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:59:49,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:59:49,308 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:59:49,308 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2024-10-14 17:59:49,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:59:49,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:59:49,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:59:49,681 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:59:49,682 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:59:49,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-10-14 17:59:51,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:59:51,535 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:59:51,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-10-14 17:59:51,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14c42f74/d7047cf071894c96a982b93d63a36b33/FLAG005f98c72 [2024-10-14 17:59:51,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14c42f74/d7047cf071894c96a982b93d63a36b33 [2024-10-14 17:59:51,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:59:51,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:59:51,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:51,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:59:51,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:59:51,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:51" (1/1) ... [2024-10-14 17:59:51,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4dd841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:51, skipping insertion in model container [2024-10-14 17:59:51,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:51" (1/1) ... [2024-10-14 17:59:51,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:59:51,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:59:51,986 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:59:52,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:59:52,087 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:59:52,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52 WrapperNode [2024-10-14 17:59:52,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:52,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:59:52,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:59:52,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:59:52,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,152 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2024-10-14 17:59:52,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:59:52,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:59:52,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:59:52,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:59:52,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,192 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [9, 6, 6]. The 0 writes are split as follows [0, 0, 0]. [2024-10-14 17:59:52,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:59:52,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:59:52,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:59:52,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:59:52,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (1/1) ... [2024-10-14 17:59:52,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:59:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:52,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:59:52,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:59:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:59:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:59:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 17:59:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-14 17:59:52,327 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-14 17:59:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:59:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:59:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:59:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:59:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:59:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:59:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 17:59:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 17:59:52,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 17:59:52,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:59:52,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:59:52,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:59:52,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:59:52,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:59:52,462 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:59:52,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:59:52,777 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-14 17:59:52,778 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:59:52,839 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:59:52,840 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 17:59:52,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:52 BoogieIcfgContainer [2024-10-14 17:59:52,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:59:52,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:59:52,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:59:52,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:59:52,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:59:51" (1/3) ... [2024-10-14 17:59:52,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12884347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:59:52, skipping insertion in model container [2024-10-14 17:59:52,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:52" (2/3) ... [2024-10-14 17:59:52,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12884347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:59:52, skipping insertion in model container [2024-10-14 17:59:52,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:52" (3/3) ... [2024-10-14 17:59:52,851 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2024-10-14 17:59:52,869 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:59:52,869 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-14 17:59:52,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:59:52,924 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;@7d59302d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:59:52,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-14 17:59:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:59:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:59:52,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:52,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:59:52,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:52,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:52,942 INFO L85 PathProgramCache]: Analyzing trace with hash 131378568, now seen corresponding path program 1 times [2024-10-14 17:59:52,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:52,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106852822] [2024-10-14 17:59:52,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:52,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:52,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:52,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:52,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 17:59:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:53,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:59:53,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:53,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:53,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:53,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106852822] [2024-10-14 17:59:53,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106852822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:53,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:53,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:59:53,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895246136] [2024-10-14 17:59:53,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:53,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:53,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:53,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:53,210 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:53,383 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2024-10-14 17:59:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:53,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:59:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:53,396 INFO L225 Difference]: With dead ends: 107 [2024-10-14 17:59:53,397 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 17:59:53,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:53,404 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 51 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:53,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 96 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 17:59:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2024-10-14 17:59:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.7142857142857142) internal successors, (96), 75 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-10-14 17:59:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2024-10-14 17:59:53,458 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 5 [2024-10-14 17:59:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:53,459 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2024-10-14 17:59:53,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2024-10-14 17:59:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:59:53,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:53,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:59:53,464 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 (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:59:53,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:53,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:53,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash 131378569, now seen corresponding path program 1 times [2024-10-14 17:59:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:53,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810512674] [2024-10-14 17:59:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:53,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:53,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:53,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:53,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 17:59:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:53,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:59:53,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:53,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:53,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:53,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810512674] [2024-10-14 17:59:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810512674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:53,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:59:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185484187] [2024-10-14 17:59:53,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:53,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:59:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:59:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:59:53,860 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:54,060 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2024-10-14 17:59:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:59:54,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:59:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:54,063 INFO L225 Difference]: With dead ends: 179 [2024-10-14 17:59:54,063 INFO L226 Difference]: Without dead ends: 179 [2024-10-14 17:59:54,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:59:54,065 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 86 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:54,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 134 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-14 17:59:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2024-10-14 17:59:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 137 states have internal predecessors, (206), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-14 17:59:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 237 transitions. [2024-10-14 17:59:54,094 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 237 transitions. Word has length 5 [2024-10-14 17:59:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:54,094 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 237 transitions. [2024-10-14 17:59:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 237 transitions. [2024-10-14 17:59:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:59:54,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:54,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:59:54,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:59:54,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:54,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:54,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash -222231707, now seen corresponding path program 1 times [2024-10-14 17:59:54,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:54,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705754045] [2024-10-14 17:59:54,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:54,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:54,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:54,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:54,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 17:59:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:54,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:59:54,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:54,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:54,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705754045] [2024-10-14 17:59:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705754045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:54,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:54,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514963270] [2024-10-14 17:59:54,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:54,504 INFO L87 Difference]: Start difference. First operand 151 states and 237 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:54,765 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-10-14 17:59:54,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:59:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:54,768 INFO L225 Difference]: With dead ends: 191 [2024-10-14 17:59:54,768 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 17:59:54,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:54,771 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 67 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:54,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 165 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 17:59:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 154. [2024-10-14 17:59:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.7272727272727273) internal successors, (209), 140 states have internal predecessors, (209), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-14 17:59:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 240 transitions. [2024-10-14 17:59:54,787 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 240 transitions. Word has length 6 [2024-10-14 17:59:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:54,787 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 240 transitions. [2024-10-14 17:59:54,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 240 transitions. [2024-10-14 17:59:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:59:54,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:54,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:54,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 17:59:54,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:54,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1700751720, now seen corresponding path program 1 times [2024-10-14 17:59:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164179419] [2024-10-14 17:59:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:54,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:54,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:59:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:55,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 17:59:55,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:55,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:55,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164179419] [2024-10-14 17:59:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164179419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:55,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:55,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560115110] [2024-10-14 17:59:55,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:55,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:55,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:55,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:55,213 INFO L87 Difference]: Start difference. First operand 154 states and 240 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:55,475 INFO L93 Difference]: Finished difference Result 181 states and 242 transitions. [2024-10-14 17:59:55,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:55,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:59:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:55,477 INFO L225 Difference]: With dead ends: 181 [2024-10-14 17:59:55,477 INFO L226 Difference]: Without dead ends: 181 [2024-10-14 17:59:55,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:55,479 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 68 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:55,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 197 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:59:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-14 17:59:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 154. [2024-10-14 17:59:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.7107438016528926) internal successors, (207), 140 states have internal predecessors, (207), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-14 17:59:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 238 transitions. [2024-10-14 17:59:55,505 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 238 transitions. Word has length 7 [2024-10-14 17:59:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:55,505 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 238 transitions. [2024-10-14 17:59:55,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2024-10-14 17:59:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:59:55,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:55,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:55,513 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-10-14 17:59:55,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:55,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:55,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1183695815, now seen corresponding path program 1 times [2024-10-14 17:59:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:55,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390194223] [2024-10-14 17:59:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:55,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:55,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:59:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:55,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:59:55,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:55,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:55,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:55,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390194223] [2024-10-14 17:59:55,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390194223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:55,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:55,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:55,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804595791] [2024-10-14 17:59:55,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:55,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:55,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:55,824 INFO L87 Difference]: Start difference. First operand 154 states and 238 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:55,981 INFO L93 Difference]: Finished difference Result 233 states and 320 transitions. [2024-10-14 17:59:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:55,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:59:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:55,983 INFO L225 Difference]: With dead ends: 233 [2024-10-14 17:59:55,983 INFO L226 Difference]: Without dead ends: 233 [2024-10-14 17:59:55,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:55,984 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 133 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:55,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 180 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:55,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-14 17:59:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 190. [2024-10-14 17:59:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 155 states have (on average 1.6580645161290322) internal successors, (257), 175 states have internal predecessors, (257), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-14 17:59:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 288 transitions. [2024-10-14 17:59:56,013 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 288 transitions. Word has length 8 [2024-10-14 17:59:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:56,013 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 288 transitions. [2024-10-14 17:59:56,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 288 transitions. [2024-10-14 17:59:56,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:59:56,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:56,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:56,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 17:59:56,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:56,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:56,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1960135350, now seen corresponding path program 1 times [2024-10-14 17:59:56,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:56,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821614450] [2024-10-14 17:59:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:56,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:56,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:56,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:56,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 17:59:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:56,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:59:56,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:56,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:59:56,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:56,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821614450] [2024-10-14 17:59:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821614450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:56,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:56,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:59:56,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887535840] [2024-10-14 17:59:56,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:56,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:59:56,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:56,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:59:56,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:59:56,353 INFO L87 Difference]: Start difference. First operand 190 states and 288 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:56,519 INFO L93 Difference]: Finished difference Result 230 states and 303 transitions. [2024-10-14 17:59:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:59:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:59:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:56,522 INFO L225 Difference]: With dead ends: 230 [2024-10-14 17:59:56,522 INFO L226 Difference]: Without dead ends: 230 [2024-10-14 17:59:56,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:59:56,523 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:56,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 199 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:59:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-14 17:59:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2024-10-14 17:59:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 164 states have (on average 1.646341463414634) internal successors, (270), 185 states have internal predecessors, (270), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-14 17:59:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2024-10-14 17:59:56,539 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 9 [2024-10-14 17:59:56,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:56,540 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2024-10-14 17:59:56,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2024-10-14 17:59:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:59:56,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:56,541 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:56,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 17:59:56,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:56,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:56,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash -519071088, now seen corresponding path program 1 times [2024-10-14 17:59:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:56,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348719958] [2024-10-14 17:59:56,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:56,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:56,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:56,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:56,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:59:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:56,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:59:56,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:56,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:57,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348719958] [2024-10-14 17:59:57,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348719958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:57,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:57,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-10-14 17:59:57,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805632814] [2024-10-14 17:59:57,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:57,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:59:57,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:57,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:59:57,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:59:57,202 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:57,515 INFO L93 Difference]: Finished difference Result 268 states and 358 transitions. [2024-10-14 17:59:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:59:57,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:59:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:57,518 INFO L225 Difference]: With dead ends: 268 [2024-10-14 17:59:57,520 INFO L226 Difference]: Without dead ends: 268 [2024-10-14 17:59:57,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:59:57,521 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 146 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:57,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 252 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:59:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-14 17:59:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 230. [2024-10-14 17:59:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 194 states have (on average 1.6391752577319587) internal successors, (318), 215 states have internal predecessors, (318), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-14 17:59:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 349 transitions. [2024-10-14 17:59:57,530 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 349 transitions. Word has length 13 [2024-10-14 17:59:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:57,530 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 349 transitions. [2024-10-14 17:59:57,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 349 transitions. [2024-10-14 17:59:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:59:57,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:57,531 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:57,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:59:57,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:57,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:57,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1088665406, now seen corresponding path program 1 times [2024-10-14 17:59:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965815534] [2024-10-14 17:59:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:57,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:57,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:57,737 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:57,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 17:59:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:57,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:59:57,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:58,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:58,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965815534] [2024-10-14 17:59:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965815534] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:58,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-14 17:59:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570126034] [2024-10-14 17:59:58,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:58,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:59:58,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:58,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:59:58,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:59:58,156 INFO L87 Difference]: Start difference. First operand 230 states and 349 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:58,608 INFO L93 Difference]: Finished difference Result 284 states and 405 transitions. [2024-10-14 17:59:58,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:59:58,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 17:59:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:58,611 INFO L225 Difference]: With dead ends: 284 [2024-10-14 17:59:58,612 INFO L226 Difference]: Without dead ends: 284 [2024-10-14 17:59:58,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 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-10-14 17:59:58,614 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 101 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:58,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 311 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:59:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-14 17:59:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 240. [2024-10-14 17:59:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.6323529411764706) internal successors, (333), 225 states have internal predecessors, (333), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-14 17:59:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 364 transitions. [2024-10-14 17:59:58,625 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 364 transitions. Word has length 14 [2024-10-14 17:59:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:58,626 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 364 transitions. [2024-10-14 17:59:58,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 364 transitions. [2024-10-14 17:59:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:59:58,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:58,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:59:58,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:59:58,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:58,828 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 17:59:58,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash -611110737, now seen corresponding path program 1 times [2024-10-14 17:59:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:59:58,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917865347] [2024-10-14 17:59:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:58,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:59:58,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:59:58,830 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:59:58,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 17:59:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:58,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 17:59:58,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:59,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:59,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:59:59,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917865347] [2024-10-14 17:59:59,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917865347] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:59,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:59:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-14 17:59:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361098668] [2024-10-14 17:59:59,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:59,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:59:59,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:59:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:59:59,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:59:59,288 INFO L87 Difference]: Start difference. First operand 240 states and 364 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:00:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:00,007 INFO L93 Difference]: Finished difference Result 413 states and 560 transitions. [2024-10-14 18:00:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:00:00,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 18:00:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:00,010 INFO L225 Difference]: With dead ends: 413 [2024-10-14 18:00:00,010 INFO L226 Difference]: Without dead ends: 413 [2024-10-14 18:00:00,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:00:00,011 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 244 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:00,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 400 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 18:00:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-14 18:00:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 325. [2024-10-14 18:00:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 285 states have (on average 1.6631578947368422) internal successors, (474), 306 states have internal predecessors, (474), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-14 18:00:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 516 transitions. [2024-10-14 18:00:00,022 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 516 transitions. Word has length 15 [2024-10-14 18:00:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:00,023 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 516 transitions. [2024-10-14 18:00:00,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:00:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 516 transitions. [2024-10-14 18:00:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:00:00,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:00,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:00,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 18:00:00,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:00,225 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 18:00:00,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -905175959, now seen corresponding path program 1 times [2024-10-14 18:00:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412679436] [2024-10-14 18:00:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:00,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:00,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:00,227 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:00:00,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 18:00:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:00,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:00:00,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:00,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:00,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412679436] [2024-10-14 18:00:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412679436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:00,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:00:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596846541] [2024-10-14 18:00:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:00,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:00:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:00:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:00:00,346 INFO L87 Difference]: Start difference. First operand 325 states and 516 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:00:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:00,393 INFO L93 Difference]: Finished difference Result 347 states and 516 transitions. [2024-10-14 18:00:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:00:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 18:00:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:00,397 INFO L225 Difference]: With dead ends: 347 [2024-10-14 18:00:00,400 INFO L226 Difference]: Without dead ends: 347 [2024-10-14 18:00:00,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:00:00,401 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 28 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:00,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 112 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:00:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-14 18:00:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 336. [2024-10-14 18:00:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 295 states have (on average 1.6) internal successors, (472), 316 states have internal predecessors, (472), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-10-14 18:00:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 513 transitions. [2024-10-14 18:00:00,414 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 513 transitions. Word has length 16 [2024-10-14 18:00:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:00,414 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 513 transitions. [2024-10-14 18:00:00,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:00:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 513 transitions. [2024-10-14 18:00:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:00:00,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:00,415 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-14 18:00:00,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 18:00:00,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:00,618 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 18:00:00,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1223463063, now seen corresponding path program 2 times [2024-10-14 18:00:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:00,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701185068] [2024-10-14 18:00:00,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:00:00,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:00,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:00,621 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:00:00,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 18:00:00,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:00:00,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:00:00,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 18:00:00,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:00,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:01,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:01,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701185068] [2024-10-14 18:00:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701185068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:00:01,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:01,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-14 18:00:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339768494] [2024-10-14 18:00:01,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:01,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:00:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:00:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:00:01,400 INFO L87 Difference]: Start difference. First operand 336 states and 513 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:00:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:02,138 INFO L93 Difference]: Finished difference Result 418 states and 631 transitions. [2024-10-14 18:00:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 18:00:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 18:00:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:02,140 INFO L225 Difference]: With dead ends: 418 [2024-10-14 18:00:02,140 INFO L226 Difference]: Without dead ends: 418 [2024-10-14 18:00:02,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-14 18:00:02,141 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 104 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:02,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 378 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 18:00:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-14 18:00:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 382. [2024-10-14 18:00:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 341 states have (on average 1.6363636363636365) internal successors, (558), 362 states have internal predecessors, (558), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-10-14 18:00:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 599 transitions. [2024-10-14 18:00:02,152 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 599 transitions. Word has length 21 [2024-10-14 18:00:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:02,153 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 599 transitions. [2024-10-14 18:00:02,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:00:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 599 transitions. [2024-10-14 18:00:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:00:02,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:02,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:02,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 18:00:02,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:02,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 18:00:02,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2085829514, now seen corresponding path program 1 times [2024-10-14 18:00:02,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:02,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514137292] [2024-10-14 18:00:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:02,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:02,359 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:00:02,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 18:00:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:02,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 18:00:02,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:02,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:02,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:02,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514137292] [2024-10-14 18:00:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514137292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:02,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:00:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929232019] [2024-10-14 18:00:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:02,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:00:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:00:02,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:00:02,426 INFO L87 Difference]: Start difference. First operand 382 states and 599 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:00:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:02,438 INFO L93 Difference]: Finished difference Result 289 states and 442 transitions. [2024-10-14 18:00:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:00:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-14 18:00:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:02,440 INFO L225 Difference]: With dead ends: 289 [2024-10-14 18:00:02,440 INFO L226 Difference]: Without dead ends: 289 [2024-10-14 18:00:02,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:00:02,441 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:02,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:00:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-14 18:00:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-10-14 18:00:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 254 states have (on average 1.6338582677165354) internal successors, (415), 274 states have internal predecessors, (415), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2024-10-14 18:00:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 442 transitions. [2024-10-14 18:00:02,453 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 442 transitions. Word has length 23 [2024-10-14 18:00:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 442 transitions. [2024-10-14 18:00:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:00:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 442 transitions. [2024-10-14 18:00:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:00:02,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:02,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:02,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 18:00:02,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:02,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 18:00:02,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 243656846, now seen corresponding path program 1 times [2024-10-14 18:00:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:02,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085659154] [2024-10-14 18:00:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:02,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:02,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:02,661 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:00:02,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 18:00:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:02,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 18:00:02,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:03,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:00:03,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:00:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:03,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:07,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:07,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085659154] [2024-10-14 18:00:07,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085659154] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:00:07,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [142810075] [2024-10-14 18:00:07,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 18:00:07,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 18:00:07,463 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 18:00:07,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-14 18:00:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:07,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-14 18:00:07,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:08,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:00:08,428 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 12 treesize of output 14 [2024-10-14 18:00:08,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:00:08,448 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 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 18:00:08,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:00:08,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-10-14 18:00:08,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [142810075] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:00:13,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:13,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 13 [2024-10-14 18:00:13,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146039553] [2024-10-14 18:00:13,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:13,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 18:00:13,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:13,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 18:00:13,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=246, Unknown=1, NotChecked=0, Total=306 [2024-10-14 18:00:13,688 INFO L87 Difference]: Start difference. First operand 289 states and 442 transitions. Second operand has 15 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:00:18,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:00:20,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 18:00:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:21,009 INFO L93 Difference]: Finished difference Result 415 states and 548 transitions. [2024-10-14 18:00:21,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 18:00:21,010 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 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 25 [2024-10-14 18:00:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:21,012 INFO L225 Difference]: With dead ends: 415 [2024-10-14 18:00:21,012 INFO L226 Difference]: Without dead ends: 415 [2024-10-14 18:00:21,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=343, Invalid=1216, Unknown=1, NotChecked=0, Total=1560 [2024-10-14 18:00:21,014 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 625 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 78 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:21,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 378 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 514 Invalid, 13 Unknown, 0 Unchecked, 5.9s Time] [2024-10-14 18:00:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-14 18:00:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 380. [2024-10-14 18:00:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 337 states have (on average 1.5074183976261128) internal successors, (508), 364 states have internal predecessors, (508), 8 states have call successors, (8), 7 states have call predecessors, (8), 17 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2024-10-14 18:00:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 542 transitions. [2024-10-14 18:00:21,026 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 542 transitions. Word has length 25 [2024-10-14 18:00:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:21,026 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 542 transitions. [2024-10-14 18:00:21,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:00:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 542 transitions. [2024-10-14 18:00:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:00:21,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:21,028 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] [2024-10-14 18:00:21,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 18:00:21,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-10-14 18:00:21,433 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,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 18:00:21,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 18:00:21,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash -605850576, now seen corresponding path program 1 times [2024-10-14 18:00:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343659373] [2024-10-14 18:00:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:21,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:21,438 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:00:21,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 18:00:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:21,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 18:00:21,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:21,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:21,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343659373] [2024-10-14 18:00:21,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343659373] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:00:21,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 18:00:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41216861] [2024-10-14 18:00:21,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:21,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:00:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:21,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:00:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:00:21,860 INFO L87 Difference]: Start difference. First operand 380 states and 542 transitions. Second operand has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:00:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:22,267 INFO L93 Difference]: Finished difference Result 457 states and 592 transitions. [2024-10-14 18:00:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 18:00:22,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 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 26 [2024-10-14 18:00:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:22,270 INFO L225 Difference]: With dead ends: 457 [2024-10-14 18:00:22,270 INFO L226 Difference]: Without dead ends: 457 [2024-10-14 18:00:22,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-10-14 18:00:22,271 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 368 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:22,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 251 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:00:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-14 18:00:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 414. [2024-10-14 18:00:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 370 states have (on average 1.4486486486486487) internal successors, (536), 397 states have internal predecessors, (536), 8 states have call successors, (8), 8 states have call predecessors, (8), 18 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2024-10-14 18:00:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 569 transitions. [2024-10-14 18:00:22,283 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 569 transitions. Word has length 26 [2024-10-14 18:00:22,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:22,283 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 569 transitions. [2024-10-14 18:00:22,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:00:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 569 transitions. [2024-10-14 18:00:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:00:22,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:22,284 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] [2024-10-14 18:00:22,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 18:00:22,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:22,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 18:00:22,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1601498623, now seen corresponding path program 1 times [2024-10-14 18:00:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:22,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033053816] [2024-10-14 18:00:22,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:22,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:22,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:22,487 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:00:22,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 18:00:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:22,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 18:00:22,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:22,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:22,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:22,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033053816] [2024-10-14 18:00:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033053816] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:00:22,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-14 18:00:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782066228] [2024-10-14 18:00:22,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:22,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:00:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:00:22,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:00:22,847 INFO L87 Difference]: Start difference. First operand 414 states and 569 transitions. Second operand has 10 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:00:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:23,441 INFO L93 Difference]: Finished difference Result 435 states and 560 transitions. [2024-10-14 18:00:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 18:00:23,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-10-14 18:00:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:23,443 INFO L225 Difference]: With dead ends: 435 [2024-10-14 18:00:23,444 INFO L226 Difference]: Without dead ends: 435 [2024-10-14 18:00:23,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2024-10-14 18:00:23,445 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 413 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:23,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 336 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:00:23,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-14 18:00:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 414. [2024-10-14 18:00:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 370 states have (on average 1.4108108108108108) internal successors, (522), 397 states have internal predecessors, (522), 8 states have call successors, (8), 8 states have call predecessors, (8), 18 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2024-10-14 18:00:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 555 transitions. [2024-10-14 18:00:23,455 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 555 transitions. Word has length 27 [2024-10-14 18:00:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:23,457 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 555 transitions. [2024-10-14 18:00:23,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:00:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 555 transitions. [2024-10-14 18:00:23,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:00:23,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:23,458 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:23,464 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 (17)] Ended with exit code 0 [2024-10-14 18:00:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:23,659 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-14 18:00:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2068973779, now seen corresponding path program 1 times [2024-10-14 18:00:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648088063] [2024-10-14 18:00:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:23,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:23,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:23,661 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:00:23,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 18:00:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:23,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 18:00:23,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:24,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:00:24,186 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